Base | Representation |
---|---|
bin | 101111001000010010… |
… | …1111100000000001010 |
3 | 100200020111200101212001 |
4 | 1132100211330000022 |
5 | 3124234242041020 |
6 | 114254551541214 |
7 | 10212036520600 |
oct | 1362045740012 |
9 | 320214611761 |
10 | 101210112010 |
11 | 39a17519177 |
12 | 1774708a80a |
13 | 970c434757 |
14 | 4c81a63870 |
15 | 29755c150a |
hex | 179097c00a |
101210112010 has 24 divisors (see below), whose sum is σ = 211921582500. Its totient is φ = 34700609664.
The previous prime is 101210111957. The next prime is 101210112023. The reversal of 101210112010 is 10211012101.
It can be written as a sum of positive squares in 2 ways, for example, as 100858961889 + 351150121 = 317583^2 + 18739^2 .
It is a super-3 number, since 3×1012101120103 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 103275135 + ... + 103276114.
Almost surely, 2101210112010 is an apocalyptic number.
101210112010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101210112010 is an abundant number, since it is smaller than the sum of its proper divisors (110711470490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101210112010 is a wasteful number, since it uses less digits than its factorization.
101210112010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206551270 (or 206551263 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101210112010 its reverse (10211012101), we get a palindrome (111421124111).
Subtracting from 101210112010 its reverse (10211012101), we obtain a palindrome (90999099909).
The spelling of 101210112010 in words is "one hundred one billion, two hundred ten million, one hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •