Base | Representation |
---|---|
bin | 11001010101000111010010… |
… | …110110010001111100111111 |
3 | 112121102221022011222001202011 |
4 | 121111013102312101330333 |
5 | 104100203002133413043 |
6 | 1032533230430512051 |
7 | 32315351664551506 |
oct | 3125072266217477 |
9 | 477387264861664 |
10 | 111402104201023 |
11 | 32550404635899 |
12 | 105b2583365627 |
13 | 4a21233b0739c |
14 | 1d71c67bab83d |
15 | cd2c5746959d |
hex | 6551d2d91f3f |
111402104201023 has 2 divisors, whose sum is σ = 111402104201024. Its totient is φ = 111402104201022.
The previous prime is 111402104200997. The next prime is 111402104201039. The reversal of 111402104201023 is 320102401204111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111402104201023 - 225 = 111402070646591 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111402104200985 and 111402104201003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111402104201123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55701052100511 + 55701052100512.
It is an arithmetic number, because the mean of its divisors is an integer number (55701052100512).
Almost surely, 2111402104201023 is an apocalyptic number.
111402104201023 is a deficient number, since it is larger than the sum of its proper divisors (1).
111402104201023 is an equidigital number, since it uses as much as digits as its factorization.
111402104201023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 111402104201023 its reverse (320102401204111), we get a palindrome (431504505405134).
The spelling of 111402104201023 in words is "one hundred eleven trillion, four hundred two billion, one hundred four million, two hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •