Base | Representation |
---|---|
bin | 1001001110010111111111… |
… | …0100111010100100111101 |
3 | 1022220121201121110200210011 |
4 | 2103211333310322210331 |
5 | 2312133431431114314 |
6 | 33323232343143221 |
7 | 2064530102422606 |
oct | 223457764724475 |
9 | 38817647420704 |
10 | 10142562363709 |
11 | 3260489046a16 |
12 | 1179843744b11 |
13 | 587593843759 |
14 | 270c8cba2dad |
15 | 128c70aad4c4 |
hex | 9397fd3a93d |
10142562363709 has 2 divisors, whose sum is σ = 10142562363710. Its totient is φ = 10142562363708.
The previous prime is 10142562363643. The next prime is 10142562363737. The reversal of 10142562363709 is 90736326524101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9590498503609 + 552063860100 = 3096853^2 + 743010^2 .
It is a cyclic number.
It is not a de Polignac number, because 10142562363709 - 215 = 10142562330941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10142562363779) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071281181854 + 5071281181855.
It is an arithmetic number, because the mean of its divisors is an integer number (5071281181855).
Almost surely, 210142562363709 is an apocalyptic number.
It is an amenable number.
10142562363709 is a deficient number, since it is larger than the sum of its proper divisors (1).
10142562363709 is an equidigital number, since it uses as much as digits as its factorization.
10142562363709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 49.
The spelling of 10142562363709 in words is "ten trillion, one hundred forty-two billion, five hundred sixty-two million, three hundred sixty-three thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •