Base | Representation |
---|---|
bin | 1010000000010110101100… |
… | …1110100000101011000100 |
3 | 1102221201001020212202201111 |
4 | 2200011223032200223010 |
5 | 2420220434303223022 |
6 | 35221515230334404 |
7 | 2213545146620320 |
oct | 240055316405304 |
9 | 42851036782644 |
10 | 11001210211012 |
11 | 35616503aa3aa |
12 | 129813705a404 |
13 | 61a543082148 |
14 | 2a06661a2980 |
15 | 141277a60477 |
hex | a016b3a0ac4 |
11001210211012 has 12 divisors (see below), whose sum is σ = 22002420422080. Its totient is φ = 4714804376136.
The previous prime is 11001210210979. The next prime is 11001210211037. The reversal of 11001210211012 is 21011201210011.
It is a happy number.
11001210211012 is an admirable number.
It is a super-2 number, since 2×110012102110122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11001210210983 and 11001210211001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 196450182312 + ... + 196450182367.
Almost surely, 211001210211012 is an apocalyptic number.
It is an amenable number.
11001210211012 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001210211012 is a wasteful number, since it uses less digits than its factorization.
11001210211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392900364690 (or 392900364688 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11001210211012 its reverse (21011201210011), we get a palindrome (32012411421023).
The spelling of 11001210211012 in words is "eleven trillion, one billion, two hundred ten million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •