Base | Representation |
---|---|
bin | 1010111010100110111110… |
… | …1111011011111100010101 |
3 | 1120111101021221111221000110 |
4 | 2232221233233123330111 |
5 | 3033120110403044341 |
6 | 41305352050433233 |
7 | 2346055036026564 |
oct | 256515757337425 |
9 | 46441257457013 |
10 | 12002013331221 |
11 | 39080306a7401 |
12 | 141a0a1b92819 |
13 | 690a28853b34 |
14 | 2d6c87147bdb |
15 | 15c2eea68216 |
hex | aea6fbdbf15 |
12002013331221 has 8 divisors (see below), whose sum is σ = 16028620723584. Its totient is φ = 7988374079840.
The previous prime is 12002013331199. The next prime is 12002013331223. The reversal of 12002013331221 is 12213331020021.
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 12002013331221 - 29 = 12002013330709 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002013331223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3242033085 + ... + 3242036786.
It is an arithmetic number, because the mean of its divisors is an integer number (2003577590448).
Almost surely, 212002013331221 is an apocalyptic number.
It is an amenable number.
12002013331221 is a deficient number, since it is larger than the sum of its proper divisors (4026607392363).
12002013331221 is an equidigital number, since it uses as much as digits as its factorization.
12002013331221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6484070491.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 12002013331221 its reverse (12213331020021), we get a palindrome (24215344351242).
The spelling of 12002013331221 in words is "twelve trillion, two billion, thirteen million, three hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •