Base | Representation |
---|---|
bin | 1001001101101010011001… |
… | …0100010011001001011001 |
3 | 1022212110010122100221020012 |
4 | 2103122212110103021121 |
5 | 2311433400221120004 |
6 | 33313450052011305 |
7 | 2063614565433164 |
oct | 223324624231131 |
9 | 38773118327205 |
10 | 10130323223129 |
11 | 32562783a94aa |
12 | 11773a8900b35 |
13 | 586392c9c335 |
14 | 27044b4d4adb |
15 | 1287a635146e |
hex | 936a6513259 |
10130323223129 has 2 divisors, whose sum is σ = 10130323223130. Its totient is φ = 10130323223128.
The previous prime is 10130323223089. The next prime is 10130323223149. The reversal of 10130323223129 is 92132232303101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10124182149904 + 6141073225 = 3181852^2 + 78365^2 .
It is a cyclic number.
It is not a de Polignac number, because 10130323223129 - 212 = 10130323219033 is a prime.
It is a super-2 number, since 2×101303232231292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10130323223095 and 10130323223104.
It is not a weakly prime, because it can be changed into another prime (10130323223149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065161611564 + 5065161611565.
It is an arithmetic number, because the mean of its divisors is an integer number (5065161611565).
Almost surely, 210130323223129 is an apocalyptic number.
It is an amenable number.
10130323223129 is a deficient number, since it is larger than the sum of its proper divisors (1).
10130323223129 is an equidigital number, since it uses as much as digits as its factorization.
10130323223129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 32.
The spelling of 10130323223129 in words is "ten trillion, one hundred thirty billion, three hundred twenty-three million, two hundred twenty-three thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •