Base | Representation |
---|---|
bin | 1011000110001000111011… |
… | …0000100000011010110011 |
3 | 1121012022121002200010201111 |
4 | 2301202032300200122303 |
5 | 3044341302130413021 |
6 | 41540352150414151 |
7 | 2366266622446444 |
oct | 261421660403263 |
9 | 47168532603644 |
10 | 12200102201011 |
11 | 398404170014a |
12 | 1450565661357 |
13 | 6a6606c4331a |
14 | 3026b94a52cb |
15 | 1625453318e1 |
hex | b188ec206b3 |
12200102201011 has 2 divisors, whose sum is σ = 12200102201012. Its totient is φ = 12200102201010.
The previous prime is 12200102200943. The next prime is 12200102201039. The reversal of 12200102201011 is 11010220100221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12200102201011 - 27 = 12200102200883 is a prime.
It is a super-2 number, since 2×122001022010112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12200102200982 and 12200102201000.
It is not a weakly prime, because it can be changed into another prime (12200102201041) by changing a digit.
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 as a sum of consecutive naturals, namely, 6100051100505 + 6100051100506.
It is an arithmetic number, because the mean of its divisors is an integer number (6100051100506).
Almost surely, 212200102201011 is an apocalyptic number.
12200102201011 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200102201011 is an equidigital number, since it uses as much as digits as its factorization.
12200102201011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12200102201011 its reverse (11010220100221), we get a palindrome (23210322301232).
The spelling of 12200102201011 in words is "twelve trillion, two hundred billion, one hundred two million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •