Base | Representation |
---|---|
bin | 10110110010010000000001… |
… | …111110100000010100101001 |
3 | 111010211000001211201200111101 |
4 | 112302100001332200110221 |
5 | 101113321002242102214 |
6 | 553043533543001401 |
7 | 30051643265465056 |
oct | 2662200176402451 |
9 | 433730054650441 |
10 | 100210210112809 |
11 | 29a25a03152235 |
12 | b2a54b0739261 |
13 | 43bba2283a894 |
14 | 1aa62b2d0c02d |
15 | b8ba6e2a7774 |
hex | 5b2401fa0529 |
100210210112809 has 2 divisors, whose sum is σ = 100210210112810. Its totient is φ = 100210210112808.
The previous prime is 100210210112807. The next prime is 100210210112819. The reversal of 100210210112809 is 908211012012001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99906961650409 + 303248462400 = 9995347^2 + 550680^2 .
It is a cyclic number.
It is not a de Polignac number, because 100210210112809 - 21 = 100210210112807 is a prime.
Together with 100210210112807, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (100210210112807) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50105105056404 + 50105105056405.
It is an arithmetic number, because the mean of its divisors is an integer number (50105105056405).
Almost surely, 2100210210112809 is an apocalyptic number.
It is an amenable number.
100210210112809 is a deficient number, since it is larger than the sum of its proper divisors (1).
100210210112809 is an equidigital number, since it uses as much as digits as its factorization.
100210210112809 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 28.
The spelling of 100210210112809 in words is "one hundred trillion, two hundred ten billion, two hundred ten million, one hundred twelve thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •