Base | Representation |
---|---|
bin | 10011011000100010000… |
… | …111011000011000111011 |
3 | 11201100011012222211021102 |
4 | 103120202013120120323 |
5 | 133310430112101021 |
6 | 2455530140402015 |
7 | 165143335034612 |
oct | 23304207303073 |
9 | 4640135884242 |
10 | 1332012222011 |
11 | 4739a31a0419 |
12 | 1961a024630b |
13 | 987ba325943 |
14 | 48680d50879 |
15 | 249ae52800b |
hex | 136221d863b |
1332012222011 has 8 divisors (see below), whose sum is σ = 1365830049360. Its totient is φ = 1298604307968.
The previous prime is 1332012221971. The next prime is 1332012222031. The reversal of 1332012222011 is 1102222102331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1332012222011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1332012222031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 102471746 + ... + 102484743.
It is an arithmetic number, because the mean of its divisors is an integer number (170728756170).
Almost surely, 21332012222011 is an apocalyptic number.
1332012222011 is a deficient number, since it is larger than the sum of its proper divisors (33817827349).
1332012222011 is an equidigital number, since it uses as much as digits as its factorization.
1332012222011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204956653.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1332012222011 its reverse (1102222102331), we get a palindrome (2434234324342).
The spelling of 1332012222011 in words is "one trillion, three hundred thirty-two billion, twelve million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •