Base | Representation |
---|---|
bin | 110011111000010101… |
… | …1011100010011111001 |
3 | 101122120111112012200201 |
4 | 1213300223130103321 |
5 | 3311132444234033 |
6 | 123103152002201 |
7 | 11022616150024 |
oct | 1476053342371 |
9 | 348514465621 |
10 | 111412102393 |
11 | 43282255589 |
12 | 19713830361 |
13 | a676c25157 |
14 | 556c9661bb |
15 | 2d7107d47d |
hex | 19f0adc4f9 |
111412102393 has 2 divisors, whose sum is σ = 111412102394. Its totient is φ = 111412102392.
The previous prime is 111412102339. The next prime is 111412102427. The reversal of 111412102393 is 393201214111.
Together with previous prime (111412102339) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105916400704 + 5495701689 = 325448^2 + 74133^2 .
It is a cyclic number.
It is not a de Polignac number, because 111412102393 - 233 = 102822167801 is a prime.
It is not a weakly prime, because it can be changed into another prime (111412102993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55706051196 + 55706051197.
It is an arithmetic number, because the mean of its divisors is an integer number (55706051197).
Almost surely, 2111412102393 is an apocalyptic number.
It is an amenable number.
111412102393 is a deficient number, since it is larger than the sum of its proper divisors (1).
111412102393 is an equidigital number, since it uses as much as digits as its factorization.
111412102393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 28.
The spelling of 111412102393 in words is "one hundred eleven billion, four hundred twelve million, one hundred two thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •