Base | Representation |
---|---|
bin | 101111111101111100… |
… | …0110001000011101101 |
3 | 100211212221212212010001 |
4 | 1133323320301003231 |
5 | 3141431103210104 |
6 | 115153334144301 |
7 | 10304455224016 |
oct | 1377370610355 |
9 | 324787785101 |
10 | 103010210029 |
11 | 3a76063a491 |
12 | 17b69ab2091 |
13 | 993835a2cc |
14 | 4db2b6400d |
15 | 2a2d648aa4 |
hex | 17fbe310ed |
103010210029 has 2 divisors, whose sum is σ = 103010210030. Its totient is φ = 103010210028.
The previous prime is 103010210021. The next prime is 103010210053. The reversal of 103010210029 is 920012010301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100107694404 + 2902515625 = 316398^2 + 53875^2 .
It is a cyclic number.
It is not a de Polignac number, because 103010210029 - 23 = 103010210021 is a prime.
It is a super-2 number, since 2×1030102100292 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103010209988 and 103010210015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103010210021) 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, 51505105014 + 51505105015.
It is an arithmetic number, because the mean of its divisors is an integer number (51505105015).
Almost surely, 2103010210029 is an apocalyptic number.
It is an amenable number.
103010210029 is a deficient number, since it is larger than the sum of its proper divisors (1).
103010210029 is an equidigital number, since it uses as much as digits as its factorization.
103010210029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
The spelling of 103010210029 in words is "one hundred three billion, ten million, two hundred ten thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •