Base | Representation |
---|---|
bin | 10111001101110000000010… |
… | …010011000001010101001001 |
3 | 111101111122221121212122222001 |
4 | 113031300002103001111021 |
5 | 101340301300240214004 |
6 | 1001052032030231001 |
7 | 30335324131033153 |
oct | 2715600223012511 |
9 | 441448847778861 |
10 | 102100001101129 |
11 | 2a594404975389 |
12 | b54b7b7955461 |
13 | 44c7cb14b3cb5 |
14 | 1b2d94892bad3 |
15 | bc0cc6b531a4 |
hex | 5cdc024c1549 |
102100001101129 has 2 divisors, whose sum is σ = 102100001101130. Its totient is φ = 102100001101128.
The previous prime is 102100001101097. The next prime is 102100001101159. The reversal of 102100001101129 is 921101100001201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93929979295504 + 8170021805625 = 9691748^2 + 2858325^2 .
It is a cyclic number.
It is not a de Polignac number, because 102100001101129 - 25 = 102100001101097 is a prime.
It is a super-3 number, since 3×1021000011011293 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (102100001101159) 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, 51050000550564 + 51050000550565.
It is an arithmetic number, because the mean of its divisors is an integer number (51050000550565).
Almost surely, 2102100001101129 is an apocalyptic number.
It is an amenable number.
102100001101129 is a deficient number, since it is larger than the sum of its proper divisors (1).
102100001101129 is an equidigital number, since it uses as much as digits as its factorization.
102100001101129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 19.
The spelling of 102100001101129 in words is "one hundred two trillion, one hundred billion, one million, one hundred one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •