Base | Representation |
---|---|
bin | 101110101010011111… |
… | …1101001111110000101 |
3 | 100120122211012200011012 |
4 | 1131110333221332011 |
5 | 3120212304032213 |
6 | 114011432452005 |
7 | 10145205552344 |
oct | 1352477517605 |
9 | 316584180135 |
10 | 100210220933 |
11 | 3955406a209 |
12 | 1750824a005 |
13 | 95b0235024 |
14 | 4bc8d43b5b |
15 | 29179124a8 |
hex | 1754fe9f85 |
100210220933 has 2 divisors, whose sum is σ = 100210220934. Its totient is φ = 100210220932.
The previous prime is 100210220881. The next prime is 100210221019. The reversal of 100210220933 is 339022012001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 76494836929 + 23715384004 = 276577^2 + 153998^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100210220933 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100210220899 and 100210220908.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100210220333) 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, 50105110466 + 50105110467.
It is an arithmetic number, because the mean of its divisors is an integer number (50105110467).
Almost surely, 2100210220933 is an apocalyptic number.
It is an amenable number.
100210220933 is a deficient number, since it is larger than the sum of its proper divisors (1).
100210220933 is an equidigital number, since it uses as much as digits as its factorization.
100210220933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 100210220933 its reverse (339022012001), we get a palindrome (439232232934).
The spelling of 100210220933 in words is "one hundred billion, two hundred ten million, two hundred twenty thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •