Base | Representation |
---|---|
bin | 10100100100001001111… |
… | …001111101111010010011 |
3 | 12000002202001202020011122 |
4 | 110210021321331322103 |
5 | 141123223332243443 |
6 | 3001115300032455 |
7 | 204046446315341 |
oct | 24441171757223 |
9 | 5002661666148 |
10 | 1413210431123 |
11 | 4a538049a767 |
12 | 1a9a8139272b |
13 | a335a775a1a |
14 | 4c584cb0991 |
15 | 26b62ccb968 |
hex | 14909e7de93 |
1413210431123 has 2 divisors, whose sum is σ = 1413210431124. Its totient is φ = 1413210431122.
The previous prime is 1413210431077. The next prime is 1413210431231. The reversal of 1413210431123 is 3211340123141.
Together with next prime (1413210431231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1413210431123 - 232 = 1408915463827 is a prime.
It is a super-2 number, since 2×14132104311232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1413210431092 and 1413210431101.
It is not a weakly prime, because it can be changed into another prime (1413210430123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 706605215561 + 706605215562.
It is an arithmetic number, because the mean of its divisors is an integer number (706605215562).
Almost surely, 21413210431123 is an apocalyptic number.
1413210431123 is a deficient number, since it is larger than the sum of its proper divisors (1).
1413210431123 is an equidigital number, since it uses as much as digits as its factorization.
1413210431123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 1413210431123 its reverse (3211340123141), we get a palindrome (4624550554264).
The spelling of 1413210431123 in words is "one trillion, four hundred thirteen billion, two hundred ten million, four hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •