Base | Representation |
---|---|
bin | 1001001110010111111111… |
… | …1000001010001111100111 |
3 | 1022220121201200001220120221 |
4 | 2103211333320022033213 |
5 | 2312133432140324221 |
6 | 33323232413305211 |
7 | 2064530112564523 |
oct | 223457770121747 |
9 | 38817650056527 |
10 | 10142563214311 |
11 | 3260489577aa0 |
12 | 1179843a95207 |
13 | 587593a80978 |
14 | 270c8cd44d83 |
15 | 128c70bca541 |
hex | 9397fe0a3e7 |
10142563214311 has 4 divisors (see below), whose sum is σ = 11064614415624. Its totient is φ = 9220512013000.
The previous prime is 10142563214309. The next prime is 10142563214323. The reversal of 10142563214311 is 11341236524101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10142563214311 - 21 = 10142563214309 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10142563214411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 461025600640 + ... + 461025600661.
It is an arithmetic number, because the mean of its divisors is an integer number (2766153603906).
Almost surely, 210142563214311 is an apocalyptic number.
10142563214311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10142563214311 is a deficient number, since it is larger than the sum of its proper divisors (922051201313).
10142563214311 is an equidigital number, since it uses as much as digits as its factorization.
10142563214311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 922051201312.
The product of its (nonzero) digits is 17280, while the sum is 34.
Adding to 10142563214311 its reverse (11341236524101), we get a palindrome (21483799738412).
The spelling of 10142563214311 in words is "ten trillion, one hundred forty-two billion, five hundred sixty-three million, two hundred fourteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •