Base | Representation |
---|---|
bin | 101110101010010000… |
… | …1011100011011000000 |
3 | 100120122021022022012210 |
4 | 1131110201130123000 |
5 | 3120203242113440 |
6 | 114010551022120 |
7 | 10145051335455 |
oct | 1352441343300 |
9 | 316567268183 |
10 | 100202301120 |
11 | 3954a64aa09 |
12 | 1750566a940 |
13 | 95ab6c124c |
14 | 4bc7c8182c |
15 | 2916d9aa80 |
hex | 175485c6c0 |
100202301120 has 112 divisors (see below), whose sum is σ = 321975601920. Its totient is φ = 26398657536.
The previous prime is 100202301109. The next prime is 100202301149. The reversal of 100202301120 is 21103202001.
It is a super-2 number, since 2×1002023011202 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 100202301096 and 100202301105.
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, 549100 + ... + 708459.
It is an arithmetic number, because the mean of its divisors is an integer number (2874782160).
Almost surely, 2100202301120 is an apocalyptic number.
100202301120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100202301120 is an abundant number, since it is smaller than the sum of its proper divisors (221773300800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100202301120 is a wasteful number, since it uses less digits than its factorization.
100202301120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1257662 (or 1257652 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 100202301120 its reverse (21103202001), we get a palindrome (121305503121).
The spelling of 100202301120 in words is "one hundred billion, two hundred two million, three hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •