Base | Representation |
---|---|
bin | 1011000110001000111010… |
… | …1100010011101011101101 |
3 | 1121012022121000121012210021 |
4 | 2301202032230103223231 |
5 | 3044341301340202034 |
6 | 41540352111042141 |
7 | 2366266610213335 |
oct | 261421654235355 |
9 | 47168530535707 |
10 | 12200101100269 |
11 | 3984041019145 |
12 | 1450565210351 |
13 | 6a66069492b4 |
14 | 3026b929a0c5 |
15 | 1625451b56b4 |
hex | b188eb13aed |
12200101100269 has 2 divisors, whose sum is σ = 12200101100270. Its totient is φ = 12200101100268.
The previous prime is 12200101100219. The next prime is 12200101100293. The reversal of 12200101100269 is 96200110100221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6941275236900 + 5258825863369 = 2634630^2 + 2293213^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200101100269 - 213 = 12200101092077 is a prime.
It is a super-2 number, since 2×122001011002692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12200101100219) 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 as a sum of consecutive naturals, namely, 6100050550134 + 6100050550135.
It is an arithmetic number, because the mean of its divisors is an integer number (6100050550135).
Almost surely, 212200101100269 is an apocalyptic number.
It is an amenable number.
12200101100269 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200101100269 is an equidigital number, since it uses as much as digits as its factorization.
12200101100269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 12200101100269 in words is "twelve trillion, two hundred billion, one hundred one million, one hundred thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •