Base | Representation |
---|---|
bin | 1001001110010111111111… |
… | …1000010010000101001011 |
3 | 1022220121201200010112121211 |
4 | 2103211333320102011023 |
5 | 2312133432142341121 |
6 | 33323232414113551 |
7 | 2064530113060231 |
oct | 223457770220513 |
9 | 38817650115554 |
10 | 10142563246411 |
11 | 326048959a122 |
12 | 1179843aab8b7 |
13 | 587593a9246b |
14 | 270c8cd52951 |
15 | 128c70bd4ce1 |
hex | 9397fe1214b |
10142563246411 has 2 divisors, whose sum is σ = 10142563246412. Its totient is φ = 10142563246410.
The previous prime is 10142563246373. The next prime is 10142563246447. The reversal of 10142563246411 is 11464236524101.
It is a strong prime.
It is an emirp because it is prime and its reverse (11464236524101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10142563246411 - 223 = 10142554857803 is a prime.
It is not a weakly prime, because it can be changed into another prime (10142563246471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071281623205 + 5071281623206.
It is an arithmetic number, because the mean of its divisors is an integer number (5071281623206).
Almost surely, 210142563246411 is an apocalyptic number.
10142563246411 is a deficient number, since it is larger than the sum of its proper divisors (1).
10142563246411 is an equidigital number, since it uses as much as digits as its factorization.
10142563246411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 138240, while the sum is 40.
The spelling of 10142563246411 in words is "ten trillion, one hundred forty-two billion, five hundred sixty-three million, two hundred forty-six thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •