Base | Representation |
---|---|
bin | 111011101100… |
… | …1011000000000 |
3 | 2011220011020220 |
4 | 1313121120000 |
5 | 31003032242 |
6 | 3034503040 |
7 | 530015640 |
oct | 167313000 |
9 | 64804226 |
10 | 31299072 |
11 | 16738502 |
12 | a594a80 |
13 | 663b37c |
14 | 422a520 |
15 | 2b33bec |
hex | 1dd9600 |
31299072 has 160 divisors (see below), whose sum is σ = 98993664. Its totient is φ = 8601600.
The previous prime is 31299071. The next prime is 31299101. The reversal of 31299072 is 27099213.
It is a super-2 number, since 2×312990722 = 1959263816122368, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31299071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 440797 + ... + 440867.
Almost surely, 231299072 is an apocalyptic number.
31299072 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31299072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49496832).
31299072 is an abundant number, since it is smaller than the sum of its proper divisors (67694592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31299072 is an equidigital number, since it uses as much as digits as its factorization.
31299072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140 (or 124 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 33.
The square root of 31299072 is about 5594.5573551444. The cubic root of 31299072 is about 315.1450478381.
The spelling of 31299072 in words is "thirty-one million, two hundred ninety-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •