Base | Representation |
---|---|
bin | 1010000000010010010001… |
… | …0110000100011100100100 |
3 | 1102221120222101012002220102 |
4 | 2200010210112010130210 |
5 | 2420211020334311322 |
6 | 35221201225523232 |
7 | 2213503526600513 |
oct | 240044426043444 |
9 | 42846871162812 |
10 | 11000021010212 |
11 | 35610a00aa223 |
12 | 1297a64943518 |
13 | 61a3b389c230 |
14 | 2a059228467a |
15 | 141208459792 |
hex | a0124584724 |
11000021010212 has 12 divisors (see below), whose sum is σ = 20730808827036. Its totient is φ = 5076932773920.
The previous prime is 11000021010197. The next prime is 11000021010227. The reversal of 11000021010212 is 21201012000011.
It is an interprime number because it is at equal distance from previous prime (11000021010197) and next prime (11000021010227).
It can be written as a sum of positive squares in 2 ways, for example, as 1166365440256 + 9833655569956 = 1079984^2 + 3135866^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11000021010193 and 11000021010202.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 105769432739 + ... + 105769432842.
It is an arithmetic number, because the mean of its divisors is an integer number (1727567402253).
Almost surely, 211000021010212 is an apocalyptic number.
It is an amenable number.
11000021010212 is a deficient number, since it is larger than the sum of its proper divisors (9730787816824).
11000021010212 is a wasteful number, since it uses less digits than its factorization.
11000021010212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 211538865598 (or 211538865596 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11000021010212 its reverse (21201012000011), we get a palindrome (32201033010223).
The spelling of 11000021010212 in words is "eleven trillion, twenty-one million, ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •