Base | Representation |
---|---|
bin | 1010111011110001110100… |
… | …0000110000101010101111 |
3 | 1120120022010211111120222111 |
4 | 2232330131000300222233 |
5 | 3033432230122400421 |
6 | 41322513202024451 |
7 | 2350365564425551 |
oct | 256743500605257 |
9 | 46508124446874 |
10 | 12022100200111 |
11 | 39155a91692a1 |
12 | 1421b69048127 |
13 | 6928aa225481 |
14 | 2d7c30ba34d1 |
15 | 15cac8242ee1 |
hex | aef1d030aaf |
12022100200111 has 16 divisors (see below), whose sum is σ = 12097235352384. Its totient is φ = 11947175460864.
The previous prime is 12022100200043. The next prime is 12022100200127. The reversal of 12022100200111 is 11100200122021.
It is a cyclic number.
It is not a de Polignac number, because 12022100200111 - 223 = 12022091811503 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12022100200091 and 12022100200100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12022100200711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1033442151 + ... + 1033453783.
It is an arithmetic number, because the mean of its divisors is an integer number (756077209524).
Almost surely, 212022100200111 is an apocalyptic number.
12022100200111 is a deficient number, since it is larger than the sum of its proper divisors (75135152273).
12022100200111 is a wasteful number, since it uses less digits than its factorization.
12022100200111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20130.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12022100200111 its reverse (11100200122021), we get a palindrome (23122300322132).
The spelling of 12022100200111 in words is "twelve trillion, twenty-two billion, one hundred million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •