Base | Representation |
---|---|
bin | 11100111001000011… |
… | …100101001001111000 |
3 | 2222001222101102220101 |
4 | 130321003211021320 |
5 | 1002013113323000 |
6 | 22130141205144 |
7 | 2145516512521 |
oct | 347103451170 |
9 | 88058342811 |
10 | 31022011000 |
11 | 1217a131022 |
12 | 60192607b4 |
13 | 2c0503ab36 |
14 | 1704085848 |
15 | c18706e6a |
hex | 7390e5278 |
31022011000 has 64 divisors (see below), whose sum is σ = 72725496480. Its totient is φ = 12385900800.
The previous prime is 31022010997. The next prime is 31022011021. The reversal of 31022011000 is 11022013.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 518644 + ... + 575356.
Almost surely, 231022011000 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 31022011000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36362748240).
31022011000 is an abundant number, since it is smaller than the sum of its proper divisors (41703485480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31022011000 is a wasteful number, since it uses less digits than its factorization.
31022011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57281 (or 57267 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 31022011000 its reverse (11022013), we get a palindrome (31033033013).
It can be divided in two parts, 3102 and 2011000, that added together give a palindrome (2014102).
The spelling of 31022011000 in words is "thirty-one billion, twenty-two million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •