Base | Representation |
---|---|
bin | 101110100111110100… |
… | …0010010101011010001 |
3 | 100120102112211122112201 |
4 | 1131033220102223101 |
5 | 3120021233211004 |
6 | 113554455323201 |
7 | 10143033513232 |
oct | 1351750225321 |
9 | 316375748481 |
10 | 100120210129 |
11 | 39508280815 |
12 | 174a2080501 |
13 | 95976ab1b4 |
14 | 4bbadd3089 |
15 | 290ea826a4 |
hex | 174fa12ad1 |
100120210129 has 2 divisors, whose sum is σ = 100120210130. Its totient is φ = 100120210128.
The previous prime is 100120210111. The next prime is 100120210133. The reversal of 100120210129 is 921012021001.
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., 65699942400 + 34420267729 = 256320^2 + 185527^2 .
It is a cyclic number.
It is not a de Polignac number, because 100120210129 - 29 = 100120209617 is a prime.
It is a super-2 number, since 2×1001202101292 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100120210829) 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, 50060105064 + 50060105065.
It is an arithmetic number, because the mean of its divisors is an integer number (50060105065).
Almost surely, 2100120210129 is an apocalyptic number.
It is an amenable number.
100120210129 is a deficient number, since it is larger than the sum of its proper divisors (1).
100120210129 is an equidigital number, since it uses as much as digits as its factorization.
100120210129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
It can be divided in two parts, 100120 and 210129, that added together give a square (310249 = 5572).
The spelling of 100120210129 in words is "one hundred billion, one hundred twenty million, two hundred ten thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •