Base | Representation |
---|---|
bin | 101110100100110101… |
… | …0011100101101010010 |
3 | 100120011120111011000101 |
4 | 1131021222130231102 |
5 | 3114320122042320 |
6 | 113540522043014 |
7 | 10140406632454 |
oct | 1351152345522 |
9 | 316146434011 |
10 | 100020112210 |
11 | 39466822767 |
12 | 1747464946a |
13 | 957ca31c65 |
14 | 4bab9b82d4 |
15 | 2905dadc0a |
hex | 1749a9cb52 |
100020112210 has 8 divisors (see below), whose sum is σ = 180036201996. Its totient is φ = 40008044880.
The previous prime is 100020112207. The next prime is 100020112243. The reversal of 100020112210 is 12211020001.
It can be written as a sum of positive squares in 2 ways, for example, as 99996985729 + 23126481 = 316223^2 + 4809^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 10002011221 = 100020112210 / (1 + 0 + 0 + 0 + 2 + 0 + 1 + 1 + 2 + 2 + 1 + 0).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5001005601 + ... + 5001005620.
Almost surely, 2100020112210 is an apocalyptic number.
100020112210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100020112210 is a deficient number, since it is larger than the sum of its proper divisors (80016089786).
100020112210 is a wasteful number, since it uses less digits than its factorization.
100020112210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10002011228.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100020112210 its reverse (12211020001), we get a palindrome (112231132211).
The spelling of 100020112210 in words is "one hundred billion, twenty million, one hundred twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •