Base | Representation |
---|---|
bin | 10010110101001110… |
… | …11110011000111011 |
3 | 222002121012000011121 |
4 | 21122213132120323 |
5 | 131201204411443 |
6 | 4351121210111 |
7 | 505353361255 |
oct | 113247363073 |
9 | 28077160147 |
10 | 10110232123 |
11 | 4318a65042 |
12 | 1b61a90937 |
13 | c517a4394 |
14 | 6bca58cd5 |
15 | 3e28d44ed |
hex | 25a9de63b |
10110232123 has 2 divisors, whose sum is σ = 10110232124. Its totient is φ = 10110232122.
The previous prime is 10110232103. The next prime is 10110232127. The reversal of 10110232123 is 32123201101.
10110232123 is digitally balanced in base 3, because in such base 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 (32123201101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10110232123 - 25 = 10110232091 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10110232097 and 10110232106.
It is not a weakly prime, because it can be changed into another prime (10110232127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055116061 + 5055116062.
It is an arithmetic number, because the mean of its divisors is an integer number (5055116062).
Almost surely, 210110232123 is an apocalyptic number.
10110232123 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110232123 is an equidigital number, since it uses as much as digits as its factorization.
10110232123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10110232123 its reverse (32123201101), we get a palindrome (42233433224).
It can be divided in two parts, 101102 and 32123, that added together give a square (133225 = 3652).
The spelling of 10110232123 in words is "ten billion, one hundred ten million, two hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •