Base | Representation |
---|---|
bin | 101110100100100110… |
… | …0010011011101010010 |
3 | 100120011000121200020000 |
4 | 1131021030103131102 |
5 | 3114311111210002 |
6 | 113540040430430 |
7 | 10140252521115 |
oct | 1351114233522 |
9 | 316130550200 |
10 | 100012210002 |
11 | 39462315711 |
12 | 17471a78416 |
13 | 957b1c61b3 |
14 | 4baa91c57c |
15 | 290534c61c |
hex | 1749313752 |
100012210002 has 60 divisors (see below), whose sum is σ = 227215330650. Its totient is φ = 32880442752.
The previous prime is 100012209991. The next prime is 100012210019. The reversal of 100012210002 is 200012210001.
It can be written as a sum of positive squares in 3 ways, for example, as 97649375121 + 2362834881 = 312489^2 + 48609^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 805374 + ... + 921222.
Almost surely, 2100012210002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100012210002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (113607665325).
100012210002 is an abundant number, since it is smaller than the sum of its proper divisors (127203120648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100012210002 is an equidigital number, since it uses as much as digits as its factorization.
100012210002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116009 (or 115927 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 100012210002 its reverse (200012210001), we get a palindrome (300024420003).
Subtracting 100012210002 from its reverse (200012210001), we obtain a palindrome (99999999999).
The spelling of 100012210002 in words is "one hundred billion, twelve million, two hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •