Base | Representation |
---|---|
bin | 11101000110011101… |
… | …100010100101011110 |
3 | 2222122122121000002110 |
4 | 131012131202211132 |
5 | 1002443202420110 |
6 | 22204333534450 |
7 | 2154220303134 |
oct | 350635424536 |
9 | 88578530073 |
10 | 31246920030 |
11 | 12285087557 |
12 | 6080644426 |
13 | 2c3c806ac1 |
14 | 1725cad754 |
15 | c2d331a20 |
hex | 74676295e |
31246920030 has 32 divisors (see below), whose sum is σ = 75693481344. Its totient is φ = 8254637216.
The previous prime is 31246920013. The next prime is 31246920059. The reversal of 31246920030 is 3002964213.
It is a super-2 number, since 2×312469200302 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 31246920030.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 4863912 + ... + 4870331.
It is an arithmetic number, because the mean of its divisors is an integer number (2365421292).
Almost surely, 231246920030 is an apocalyptic number.
31246920030 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31246920030 is an abundant number, since it is smaller than the sum of its proper divisors (44446561314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31246920030 is a wasteful number, since it uses less digits than its factorization.
31246920030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9734360.
The product of its (nonzero) digits is 7776, while the sum is 30.
The spelling of 31246920030 in words is "thirty-one billion, two hundred forty-six million, nine hundred twenty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •