Base | Representation |
---|---|
bin | 101110101010010000… |
… | …1000011111110101000 |
3 | 100120122021010012212122 |
4 | 1131110201003332220 |
5 | 3120203230413000 |
6 | 114010544530412 |
7 | 10145050440536 |
oct | 1352441037650 |
9 | 316567105778 |
10 | 100202201000 |
11 | 3954a591770 |
12 | 17505620a08 |
13 | 95ab6877c5 |
14 | 4bc7c57156 |
15 | 2916d7b085 |
hex | 1754843fa8 |
100202201000 has 128 divisors (see below), whose sum is σ = 258324318720. Its totient is φ = 36076000000.
The previous prime is 100202200997. The next prime is 100202201039. The reversal of 100202201000 is 102202001.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1065905 + ... + 1156095.
It is an arithmetic number, because the mean of its divisors is an integer number (2018158740).
Almost surely, 2100202201000 is an apocalyptic number.
100202201000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100202201000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129162159360).
100202201000 is an abundant number, since it is smaller than the sum of its proper divisors (158122117720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100202201000 is a wasteful number, since it uses less digits than its factorization.
100202201000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90324 (or 90310 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 100202201000 its reverse (102202001), we get a palindrome (100304403001).
The spelling of 100202201000 in words is "one hundred billion, two hundred two million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •