Base | Representation |
---|---|
bin | 10010110110110000… |
… | …10010110011100011 |
3 | 222010111021012012002 |
4 | 21123120102303203 |
5 | 131212443422411 |
6 | 4352255354215 |
7 | 505600222133 |
oct | 113330226343 |
9 | 28114235162 |
10 | 10123029731 |
11 | 4325206081 |
12 | 1b6622296b |
13 | c54335429 |
14 | 6c062aac3 |
15 | 3e3ab133b |
hex | 25b612ce3 |
10123029731 has 2 divisors, whose sum is σ = 10123029732. Its totient is φ = 10123029730.
The previous prime is 10123029701. The next prime is 10123029737. The reversal of 10123029731 is 13792032101.
10123029731 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (13792032101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10123029731 - 26 = 10123029667 is a prime.
It is a super-2 number, since 2×101230297312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10123029694 and 10123029703.
It is not a weakly prime, because it can be changed into another prime (10123029737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061514865 + 5061514866.
It is an arithmetic number, because the mean of its divisors is an integer number (5061514866).
Almost surely, 210123029731 is an apocalyptic number.
10123029731 is a deficient number, since it is larger than the sum of its proper divisors (1).
10123029731 is an equidigital number, since it uses as much as digits as its factorization.
10123029731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 29.
The spelling of 10123029731 in words is "ten billion, one hundred twenty-three million, twenty-nine thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •