Base | Representation |
---|---|
bin | 101110100101001001… |
… | …1111111011011010000 |
3 | 100120012022222102102210 |
4 | 1131022103333123100 |
5 | 3114330414033240 |
6 | 113541551312120 |
7 | 10140601330164 |
oct | 1351223773320 |
9 | 316168872383 |
10 | 100031002320 |
11 | 39471990657 |
12 | 1747821b640 |
13 | 9582075a02 |
14 | 4bad210ca4 |
15 | 2906d10780 |
hex | 174a4ff6d0 |
100031002320 has 80 divisors (see below), whose sum is σ = 310126525632. Its totient is φ = 26672317440.
The previous prime is 100031002307. The next prime is 100031002327. The reversal of 100031002320 is 23200130001.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
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 = 100031002296 and 100031002305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100031002327) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4645980 + ... + 4667460.
Almost surely, 2100031002320 is an apocalyptic number.
100031002320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100031002320 is an abundant number, since it is smaller than the sum of its proper divisors (210095523312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100031002320 is a wasteful number, since it uses less digits than its factorization.
100031002320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40900 (or 40894 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 100031002320 its reverse (23200130001), we get a palindrome (123231132321).
The spelling of 100031002320 in words is "one hundred billion, thirty-one million, two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •