Base | Representation |
---|---|
bin | 101111001000010011… |
… | …0010001011110010001 |
3 | 100200020111211212111012 |
4 | 1132100212101132101 |
5 | 3124234302344303 |
6 | 114254553500305 |
7 | 10212040335152 |
oct | 1362046213621 |
9 | 320214755435 |
10 | 101210199953 |
11 | 39a17579255 |
12 | 17747111695 |
13 | 970c4657a5 |
14 | 4c81a87929 |
15 | 29755dc5d8 |
hex | 1790991791 |
101210199953 has 2 divisors, whose sum is σ = 101210199954. Its totient is φ = 101210199952.
The previous prime is 101210199949. The next prime is 101210199973. The reversal of 101210199953 is 359991012101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101052144769 + 158055184 = 317887^2 + 12572^2 .
It is a cyclic number.
It is not a de Polignac number, because 101210199953 - 22 = 101210199949 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101210199953.
It is not a weakly prime, because it can be changed into another prime (101210199943) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50605099976 + 50605099977.
It is an arithmetic number, because the mean of its divisors is an integer number (50605099977).
Almost surely, 2101210199953 is an apocalyptic number.
It is an amenable number.
101210199953 is a deficient number, since it is larger than the sum of its proper divisors (1).
101210199953 is an equidigital number, since it uses as much as digits as its factorization.
101210199953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21870, while the sum is 41.
The spelling of 101210199953 in words is "one hundred one billion, two hundred ten million, one hundred ninety-nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •