Base | Representation |
---|---|
bin | 101011101011000110101… |
… | …110011011001000010001 |
3 | 101121220200021020020121101 |
4 | 223223012232123020101 |
5 | 343133000113343441 |
6 | 10214424134424401 |
7 | 426555026356501 |
oct | 53530656331021 |
9 | 11556607206541 |
10 | 3001221231121 |
11 | a578a11637a3 |
12 | 4057a6b02101 |
13 | 18a024848c79 |
14 | a538d191a01 |
15 | 53106a75231 |
hex | 2bac6b9b211 |
3001221231121 has 8 divisors (see below), whose sum is σ = 3014870630400. Its totient is φ = 2987601218400.
The previous prime is 3001221231067. The next prime is 3001221231161. The reversal of 3001221231121 is 1211321221003.
3001221231121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3001221231121 - 211 = 3001221229073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3001221231161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7141905 + ... + 7550446.
It is an arithmetic number, because the mean of its divisors is an integer number (376858828800).
Almost surely, 23001221231121 is an apocalyptic number.
It is an amenable number.
3001221231121 is a deficient number, since it is larger than the sum of its proper divisors (13649399279).
3001221231121 is a wasteful number, since it uses less digits than its factorization.
3001221231121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14693279.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 3001221231121 its reverse (1211321221003), we get a palindrome (4212542452124).
The spelling of 3001221231121 in words is "three trillion, one billion, two hundred twenty-one million, two hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •