Base | Representation |
---|---|
bin | 101110100100110101… |
… | …0110101000100100000 |
3 | 100120011120200012220022 |
4 | 1131021222311010200 |
5 | 3114320133241000 |
6 | 113540524133012 |
7 | 10140410526422 |
oct | 1351152650440 |
9 | 316146605808 |
10 | 100020212000 |
11 | 39466890735 |
12 | 17474697168 |
13 | 957ca684c7 |
14 | 4baba02812 |
15 | 2905dcd585 |
hex | 1749ab5120 |
100020212000 has 48 divisors (see below), whose sum is σ = 245749670712. Its totient is φ = 40008083200.
The previous prime is 100020211997. The next prime is 100020212003. The reversal of 100020212000 is 212020001.
It is an interprime number because it is at equal distance from previous prime (100020211997) and next prime (100020212003).
It can be written as a sum of positive squares in 4 ways, for example, as 5650829584 + 94369382416 = 75172^2 + 307196^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is not an unprimeable number, because it can be changed into a prime (100020212003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12498527 + ... + 12506526.
Almost surely, 2100020212000 is an apocalyptic number.
100020212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100020212000 is an abundant number, since it is smaller than the sum of its proper divisors (145729458712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100020212000 is an equidigital number, since it uses as much as digits as its factorization.
100020212000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25005078 (or 25005060 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 100020212000 its reverse (212020001), we get a palindrome (100232232001).
The spelling of 100020212000 in words is "one hundred billion, twenty million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •