Base | Representation |
---|---|
bin | 110000000100011111… |
… | …1100101001011110100 |
3 | 100212110021122102201220 |
4 | 1200020333211023310 |
5 | 3142403401201322 |
6 | 115231231150340 |
7 | 10313065242201 |
oct | 1401077451364 |
9 | 325407572656 |
10 | 103230100212 |
11 | 3a863778208 |
12 | 1800b6753b0 |
13 | 9971a89a45 |
14 | 4dd4042ca8 |
15 | 2a42ad155c |
hex | 1808fe52f4 |
103230100212 has 48 divisors (see below), whose sum is σ = 263833536960. Its totient is φ = 31269156352.
The previous prime is 103230100177. The next prime is 103230100247. The reversal of 103230100212 is 212001032301.
It is an interprime number because it is at equal distance from previous prime (103230100177) and next prime (103230100247).
It is a junction number, because it is equal to n+sod(n) for n = 103230100191 and 103230100200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8718738 + ... + 8730569.
It is an arithmetic number, because the mean of its divisors is an integer number (5496532020).
Almost surely, 2103230100212 is an apocalyptic number.
103230100212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103230100212 is an abundant number, since it is smaller than the sum of its proper divisors (160603436748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103230100212 is a wasteful number, since it uses less digits than its factorization.
103230100212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17449360 (or 17449358 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 103230100212 its reverse (212001032301), we get a palindrome (315231132513).
The spelling of 103230100212 in words is "one hundred three billion, two hundred thirty million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •