Base | Representation |
---|---|
bin | 1001001110010111111111… |
… | …1000001010001111001001 |
3 | 1022220121201200001220112211 |
4 | 2103211333320022033021 |
5 | 2312133432140324111 |
6 | 33323232413305121 |
7 | 2064530112564451 |
oct | 223457770121711 |
9 | 38817650056484 |
10 | 10142563214281 |
11 | 3260489577a73 |
12 | 1179843a951a1 |
13 | 587593a80954 |
14 | 270c8cd44d61 |
15 | 128c70bca521 |
hex | 9397fe0a3c9 |
10142563214281 has 2 divisors, whose sum is σ = 10142563214282. Its totient is φ = 10142563214280.
The previous prime is 10142563214261. The next prime is 10142563214297. The reversal of 10142563214281 is 18241236524101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9360295491600 + 782267722681 = 3059460^2 + 884459^2 .
It is a cyclic number.
It is not a de Polignac number, because 10142563214281 - 211 = 10142563212233 is a prime.
It is a super-2 number, since 2×101425632142812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10142563214261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071281607140 + 5071281607141.
It is an arithmetic number, because the mean of its divisors is an integer number (5071281607141).
Almost surely, 210142563214281 is an apocalyptic number.
It is an amenable number.
10142563214281 is a deficient number, since it is larger than the sum of its proper divisors (1).
10142563214281 is an equidigital number, since it uses as much as digits as its factorization.
10142563214281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 92160, while the sum is 40.
Adding to 10142563214281 its reverse (18241236524101), we get a palindrome (28383799738382).
The spelling of 10142563214281 in words is "ten trillion, one hundred forty-two billion, five hundred sixty-three million, two hundred fourteen thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •