Base | Representation |
---|---|
bin | 10110110000001110001111… |
… | …111111010011001000000001 |
3 | 111010022200101012120202000001 |
4 | 112300032033333103020001 |
5 | 101104030104320433201 |
6 | 552455530132000001 |
7 | 30035611111536331 |
oct | 2660161777231001 |
9 | 433280335522001 |
10 | 100070858764801 |
11 | 299818a3a26a21 |
12 | b2824a0160001 |
13 | 43ab84547a142 |
14 | 1a9d6538cd0c1 |
15 | b881154b4301 |
hex | 5b038ffd3201 |
100070858764801 has 2 divisors, whose sum is σ = 100070858764802. Its totient is φ = 100070858764800.
The previous prime is 100070858764783. The next prime is 100070858764831. The reversal of 100070858764801 is 108467858070001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99149834674801 + 921024090000 = 9957401^2 + 959700^2 .
It is an emirp because it is prime and its reverse (108467858070001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100070858764801 - 25 = 100070858764769 is a prime.
It is not a weakly prime, because it can be changed into another prime (100070858764831) 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, 50035429382400 + 50035429382401.
It is an arithmetic number, because the mean of its divisors is an integer number (50035429382401).
Almost surely, 2100070858764801 is an apocalyptic number.
It is an amenable number.
100070858764801 is a deficient number, since it is larger than the sum of its proper divisors (1).
100070858764801 is an equidigital number, since it uses as much as digits as its factorization.
100070858764801 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3010560, while the sum is 55.
The spelling of 100070858764801 in words is "one hundred trillion, seventy billion, eight hundred fifty-eight million, seven hundred sixty-four thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •