Base | Representation |
---|---|
bin | 1001001110010111111111… |
… | …1000100110100001010001 |
3 | 1022220121201200021210110111 |
4 | 2103211333320212201101 |
5 | 2312133432203031004 |
6 | 33323232420001321 |
7 | 2064530113556266 |
oct | 223457770464121 |
9 | 38817650253414 |
10 | 10142563330129 |
11 | 326048964700a |
12 | 1179843b30241 |
13 | 587593ac15b9 |
14 | 270c8cd7526d |
15 | 128c70beea04 |
hex | 9397fe26851 |
10142563330129 has 2 divisors, whose sum is σ = 10142563330130. Its totient is φ = 10142563330128.
The previous prime is 10142563330099. The next prime is 10142563330157. The reversal of 10142563330129 is 92103336524101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5143529164225 + 4999034165904 = 2267935^2 + 2235852^2 .
It is a cyclic number.
It is not a de Polignac number, because 10142563330129 - 211 = 10142563328081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10142563330091 and 10142563330100.
It is not a weakly prime, because it can be changed into another prime (10142563330189) 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, 5071281665064 + 5071281665065.
It is an arithmetic number, because the mean of its divisors is an integer number (5071281665065).
Almost surely, 210142563330129 is an apocalyptic number.
It is an amenable number.
10142563330129 is a deficient number, since it is larger than the sum of its proper divisors (1).
10142563330129 is an equidigital number, since it uses as much as digits as its factorization.
10142563330129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 40.
The spelling of 10142563330129 in words is "ten trillion, one hundred forty-two billion, five hundred sixty-three million, three hundred thirty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •