Base | Representation |
---|---|
bin | 10011000001011000… |
… | …00100110010110100 |
3 | 222100200212111102002 |
4 | 21200230010302310 |
5 | 131403244220200 |
6 | 4405200434432 |
7 | 511031300042 |
oct | 114054046264 |
9 | 28320774362 |
10 | 10212101300 |
11 | 4370512945 |
12 | 1b90018a18 |
13 | c699208bb |
14 | 6cc3b5392 |
15 | 3eb807bd5 |
hex | 260b04cb4 |
10212101300 has 18 divisors (see below), whose sum is σ = 22160260038. Its totient is φ = 4084840480.
The previous prime is 10212101299. The next prime is 10212101303. The reversal of 10212101300 is 310121201.
It can be written as a sum of positive squares in 3 ways, for example, as 631215376 + 9580885924 = 25124^2 + 97882^2 .
It is a super-2 number, since 2×102121013002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212101303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 51060407 + ... + 51060606.
Almost surely, 210212101300 is an apocalyptic number.
10212101300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10212101300 is an abundant number, since it is smaller than the sum of its proper divisors (11948158738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10212101300 is a wasteful number, since it uses less digits than its factorization.
10212101300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102121027 (or 102121020 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10212101300 its reverse (310121201), we get a palindrome (10522222501).
The spelling of 10212101300 in words is "ten billion, two hundred twelve million, one hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •