Base | Representation |
---|---|
bin | 101110101010100000… |
… | …0010110011110001101 |
3 | 100120122211112221012022 |
4 | 1131111000112132031 |
5 | 3120212330400323 |
6 | 114011440415525 |
7 | 10145210241644 |
oct | 1352500263615 |
9 | 316584487168 |
10 | 100210403213 |
11 | 39554184158 |
12 | 175083175a5 |
13 | 95b0299c9b |
14 | 4bc8d9035b |
15 | 291794b4c8 |
hex | 175501678d |
100210403213 has 2 divisors, whose sum is σ = 100210403214. Its totient is φ = 100210403212.
The previous prime is 100210403207. The next prime is 100210403281. The reversal of 100210403213 is 312304012001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99551608324 + 658794889 = 315518^2 + 25667^2 .
It is a cyclic number.
It is not a de Polignac number, because 100210403213 - 216 = 100210337677 is a prime.
It is a super-2 number, since 2×1002104032132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100210403191 and 100210403200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100210403203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50105201606 + 50105201607.
It is an arithmetic number, because the mean of its divisors is an integer number (50105201607).
Almost surely, 2100210403213 is an apocalyptic number.
It is an amenable number.
100210403213 is a deficient number, since it is larger than the sum of its proper divisors (1).
100210403213 is an equidigital number, since it uses as much as digits as its factorization.
100210403213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 100210403213 its reverse (312304012001), we get a palindrome (412514415214).
The spelling of 100210403213 in words is "one hundred billion, two hundred ten million, four hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •