Base | Representation |
---|---|
bin | 10010110110110001… |
… | …01001101001011001 |
3 | 222010111102221112012 |
4 | 21123120221221121 |
5 | 131213004421124 |
6 | 4352301355305 |
7 | 505601061656 |
oct | 113330515131 |
9 | 28114387465 |
10 | 10123123289 |
11 | 432526a3a4 |
12 | 1b66268b35 |
13 | c54368ba6 |
14 | 6c0652c2d |
15 | 3e3acde0e |
hex | 25b629a59 |
10123123289 has 2 divisors, whose sum is σ = 10123123290. Its totient is φ = 10123123288.
The previous prime is 10123123277. The next prime is 10123123321. The reversal of 10123123289 is 98232132101.
10123123289 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (10123123321) can be obtained adding 10123123289 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9026520064 + 1096603225 = 95008^2 + 33115^2 .
It is a cyclic number.
It is not a de Polignac number, because 10123123289 - 220 = 10122074713 is a prime.
It is not a weakly prime, because it can be changed into another prime (10123123189) 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, 5061561644 + 5061561645.
It is an arithmetic number, because the mean of its divisors is an integer number (5061561645).
Almost surely, 210123123289 is an apocalyptic number.
It is an amenable number.
10123123289 is a deficient number, since it is larger than the sum of its proper divisors (1).
10123123289 is an equidigital number, since it uses as much as digits as its factorization.
10123123289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 10123123289 in words is "ten billion, one hundred twenty-three million, one hundred twenty-three thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •