Base | Representation |
---|---|
bin | 10111001111001101001010… |
… | …110000110100111010110001 |
3 | 111101212020001210120001210121 |
4 | 113033031022300310322301 |
5 | 101343421100241400334 |
6 | 1001210010553530241 |
7 | 30345464205136342 |
oct | 2717151260647261 |
9 | 441766053501717 |
10 | 102200001121969 |
11 | 2a622860315103 |
12 | b567065713981 |
13 | 450455a00006a |
14 | 1b347139960c9 |
15 | bc36cad93db4 |
hex | 5cf34ac34eb1 |
102200001121969 has 2 divisors, whose sum is σ = 102200001121970. Its totient is φ = 102200001121968.
The previous prime is 102200001121931. The next prime is 102200001122027. The reversal of 102200001121969 is 969121100002201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78036022440000 + 24163978681969 = 8833800^2 + 4915687^2 .
It is an emirp because it is prime and its reverse (969121100002201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102200001121969 - 221 = 102199999024817 is a prime.
It is a super-2 number, since 2×1022000011219692 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102200001121469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51100000560984 + 51100000560985.
It is an arithmetic number, because the mean of its divisors is an integer number (51100000560985).
Almost surely, 2102200001121969 is an apocalyptic number.
It is an amenable number.
102200001121969 is a deficient number, since it is larger than the sum of its proper divisors (1).
102200001121969 is an equidigital number, since it uses as much as digits as its factorization.
102200001121969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 34.
The spelling of 102200001121969 in words is "one hundred two trillion, two hundred billion, one million, one hundred twenty-one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •