Base | Representation |
---|---|
bin | 101111100011100101… |
… | …1110111100110101001 |
3 | 100202121100010121110011 |
4 | 1133013023313212221 |
5 | 3133123230301004 |
6 | 114525511051521 |
7 | 10243530614332 |
oct | 1370713674651 |
9 | 322540117404 |
10 | 102126025129 |
11 | 3a34752a267 |
12 | 17961970ba1 |
13 | 982711028b |
14 | 4d2b563289 |
15 | 29cabe3004 |
hex | 17c72f79a9 |
102126025129 has 2 divisors, whose sum is σ = 102126025130. Its totient is φ = 102126025128.
The previous prime is 102126025091. The next prime is 102126025139. The reversal of 102126025129 is 921520621201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98691479104 + 3434546025 = 314152^2 + 58605^2 .
It is an emirp because it is prime and its reverse (921520621201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102126025129 - 211 = 102126023081 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102126025129.
It is not a weakly prime, because it can be changed into another prime (102126025139) 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, 51063012564 + 51063012565.
It is an arithmetic number, because the mean of its divisors is an integer number (51063012565).
Almost surely, 2102126025129 is an apocalyptic number.
It is an amenable number.
102126025129 is a deficient number, since it is larger than the sum of its proper divisors (1).
102126025129 is an equidigital number, since it uses as much as digits as its factorization.
102126025129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 31.
The spelling of 102126025129 in words is "one hundred two billion, one hundred twenty-six million, twenty-five thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •