Base | Representation |
---|---|
bin | 11100111001000001… |
… | …110100101000101000 |
3 | 2222001221112000200202 |
4 | 130321001310220220 |
5 | 1002013004100440 |
6 | 22130123251332 |
7 | 2145512553041 |
oct | 347101645050 |
9 | 88057460622 |
10 | 31021550120 |
11 | 12179946830 |
12 | 6019079b48 |
13 | 2c04c09122 |
14 | 1703da58c8 |
15 | c18665615 |
hex | 739074a28 |
31021550120 has 64 divisors (see below), whose sum is σ = 76265159040. Its totient is φ = 11262585600.
The previous prime is 31021550113. The next prime is 31021550129. The reversal of 31021550120 is 2105512013.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 31021550092 and 31021550101.
It is not an unprimeable number, because it can be changed into a prime (31021550129) 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, 221774 + ... + 333506.
It is an arithmetic number, because the mean of its divisors is an integer number (1191643110).
Almost surely, 231021550120 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31021550120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38132579520).
31021550120 is an abundant number, since it is smaller than the sum of its proper divisors (45243608920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31021550120 is a wasteful number, since it uses less digits than its factorization.
31021550120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112386 (or 112382 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 20.
The spelling of 31021550120 in words is "thirty-one billion, twenty-one million, five hundred fifty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •