Base | Representation |
---|---|
bin | 111001010010100111… |
… | …0011010001010101011 |
3 | 102202120020201112221001 |
4 | 1302211032122022223 |
5 | 4003431430231443 |
6 | 132304131255431 |
7 | 11613553053556 |
oct | 1624516321253 |
9 | 382506645831 |
10 | 123031102123 |
11 | 481a4938aa6 |
12 | 1ba16a4a577 |
13 | b7a916b417 |
14 | 5d51b2769d |
15 | 330113ed4d |
hex | 1ca539a2ab |
123031102123 has 2 divisors, whose sum is σ = 123031102124. Its totient is φ = 123031102122.
The previous prime is 123031102121. The next prime is 123031102127. The reversal of 123031102123 is 321201130321.
It is a weak prime.
It is an emirp because it is prime and its reverse (321201130321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123031102123 - 21 = 123031102121 is a prime.
Together with 123031102121, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 123031102123.
It is not a weakly prime, because it can be changed into another prime (123031102121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61515551061 + 61515551062.
It is an arithmetic number, because the mean of its divisors is an integer number (61515551062).
Almost surely, 2123031102123 is an apocalyptic number.
123031102123 is a deficient number, since it is larger than the sum of its proper divisors (1).
123031102123 is an equidigital number, since it uses as much as digits as its factorization.
123031102123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 123031102123 its reverse (321201130321), we get a palindrome (444232232444).
The spelling of 123031102123 in words is "one hundred twenty-three billion, thirty-one million, one hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •