Base | Representation |
---|---|
bin | 1010000000010110101101… |
… | …0110100001101000111010 |
3 | 1102221201001101211111220101 |
4 | 2200011223112201220322 |
5 | 2420220440322441442 |
6 | 35221515343350014 |
7 | 2213545203521104 |
oct | 240055326415072 |
9 | 42851041744811 |
10 | 11001212312122 |
11 | 3561651604a5a |
12 | 12981378b230a |
13 | 61a5436395c6 |
14 | 2a066658c574 |
15 | 141277d27cb7 |
hex | a016b5a1a3a |
11001212312122 has 8 divisors (see below), whose sum is σ = 16502827864500. Its totient is φ = 5500269690624.
The previous prime is 11001212312117. The next prime is 11001212312183. The reversal of 11001212312122 is 22121321210011.
It can be written as a sum of positive squares in 2 ways, for example, as 9345304026081 + 1655908286041 = 3057009^2 + 1286821^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×110012123121222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11001212312122.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 168191847 + ... + 168257242.
Almost surely, 211001212312122 is an apocalyptic number.
11001212312122 is a deficient number, since it is larger than the sum of its proper divisors (5501615552378).
11001212312122 is a wasteful number, since it uses less digits than its factorization.
11001212312122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336465440.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 11001212312122 its reverse (22121321210011), we get a palindrome (33122533522133).
The spelling of 11001212312122 in words is "eleven trillion, one billion, two hundred twelve million, three hundred twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •