Base | Representation |
---|---|
bin | 10111001101110000000010… |
… | …111100100111011110010101 |
3 | 111101111122222101101122122002 |
4 | 113031300002330213132111 |
5 | 101340301311033132034 |
6 | 1001052033100045045 |
7 | 30335324322516515 |
oct | 2715600274473625 |
9 | 441448871348562 |
10 | 102100012005269 |
11 | 2a594410042873 |
12 | b54b7bb533785 |
13 | 44c7cb3831255 |
14 | 1b2d94a169845 |
15 | bc0cc7aa8e7e |
hex | 5cdc02f27795 |
102100012005269 has 2 divisors, whose sum is σ = 102100012005270. Its totient is φ = 102100012005268.
The previous prime is 102100012005221. The next prime is 102100012005281. The reversal of 102100012005269 is 962500210001201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84631039437169 + 17468972568100 = 9199513^2 + 4179590^2 .
It is an emirp because it is prime and its reverse (962500210001201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102100012005269 - 220 = 102100010956693 is a prime.
It is a super-2 number, since 2×1021000120052692 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102100012001269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51050006002634 + 51050006002635.
It is an arithmetic number, because the mean of its divisors is an integer number (51050006002635).
Almost surely, 2102100012005269 is an apocalyptic number.
It is an amenable number.
102100012005269 is a deficient number, since it is larger than the sum of its proper divisors (1).
102100012005269 is an equidigital number, since it uses as much as digits as its factorization.
102100012005269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 29.
The spelling of 102100012005269 in words is "one hundred two trillion, one hundred billion, twelve million, five thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •