Base | Representation |
---|---|
bin | 101111001000010010… |
… | …1100011001001100010 |
3 | 100200020111111020012200 |
4 | 1132100211203021202 |
5 | 3124234230311320 |
6 | 114254545434030 |
7 | 10212035615031 |
oct | 1362045431142 |
9 | 320214436180 |
10 | 101210010210 |
11 | 39a17459741 |
12 | 1774703b916 |
13 | 970c3ca30a |
14 | 4c81a38718 |
15 | 29755a1290 |
hex | 1790963262 |
101210010210 has 24 divisors (see below), whose sum is σ = 263146026780. Its totient is φ = 26989336032.
The previous prime is 101210010173. The next prime is 101210010211. The reversal of 101210010210 is 12010012101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 99817451721 + 1392558489 = 315939^2 + 37317^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 101210010192 and 101210010201.
It is not an unprimeable number, because it can be changed into a prime (101210010211) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 562277745 + ... + 562277924.
Almost surely, 2101210010210 is an apocalyptic number.
101210010210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101210010210 is an abundant number, since it is smaller than the sum of its proper divisors (161936016570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101210010210 is a wasteful number, since it uses less digits than its factorization.
101210010210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1124555682 (or 1124555679 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101210010210 its reverse (12010012101), we get a palindrome (113220022311).
The spelling of 101210010210 in words is "one hundred one billion, two hundred ten million, ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •