Base | Representation |
---|---|
bin | 11100111110011101… |
… | …001010001001110000 |
3 | 2222022021211221200220 |
4 | 130332131022021300 |
5 | 1002204311232344 |
6 | 22143135013040 |
7 | 2150666520054 |
oct | 347635121160 |
9 | 88267757626 |
10 | 31112602224 |
11 | 12216286600 |
12 | 604366a180 |
13 | 2c1aa38c02 |
14 | 1712107c64 |
15 | c2164dc19 |
hex | 73e74a270 |
31112602224 has 120 divisors (see below), whose sum is σ = 93542294160. Its totient is φ = 8873441280.
The previous prime is 31112602223. The next prime is 31112602229. The reversal of 31112602224 is 42220621113.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 31112602194 and 31112602203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31112602223) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 58819 + ... + 256290.
It is an arithmetic number, because the mean of its divisors is an integer number (779519118).
Almost surely, 231112602224 is an apocalyptic number.
31112602224 is a gapful number since it is divisible by the number (34) formed by its first and last digit.
It is an amenable number.
31112602224 is an abundant number, since it is smaller than the sum of its proper divisors (62429691936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31112602224 is a wasteful number, since it uses less digits than its factorization.
31112602224 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 315159 (or 315142 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
It can be divided in two parts, 31112 and 602224, that added together give a palindrome (633336).
The spelling of 31112602224 in words is "thirty-one billion, one hundred twelve million, six hundred two thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •