Base | Representation |
---|---|
bin | 1011000110001100010001… |
… | …0101100010101100011111 |
3 | 1121012101220202010001012211 |
4 | 2301203010111202230133 |
5 | 3044400122240231421 |
6 | 41541021301141251 |
7 | 2366331116130403 |
oct | 261430425425437 |
9 | 47171822101184 |
10 | 12201001102111 |
11 | 3984463051918 |
12 | 14507766ba827 |
13 | 6a671b243773 |
14 | 302762a17103 |
15 | 1625991e29e1 |
hex | b18c4562b1f |
12201001102111 has 8 divisors (see below), whose sum is σ = 13219142097744. Its totient is φ = 11216241778560.
The previous prime is 12201001102109. The next prime is 12201001102123. The reversal of 12201001102111 is 11120110010221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12201001102111 - 21 = 12201001102109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12201001102091 and 12201001102100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201001142111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8345417260 + ... + 8345418721.
It is an arithmetic number, because the mean of its divisors is an integer number (1652392762218).
Almost surely, 212201001102111 is an apocalyptic number.
12201001102111 is a deficient number, since it is larger than the sum of its proper divisors (1018140995633).
12201001102111 is a wasteful number, since it uses less digits than its factorization.
12201001102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16690836041.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12201001102111 its reverse (11120110010221), we get a palindrome (23321111112332).
The spelling of 12201001102111 in words is "twelve trillion, two hundred one billion, one million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •