Base | Representation |
---|---|
bin | 11101010000111001… |
… | …100010100010000000 |
3 | 10000002212002121112222 |
4 | 131100321202202000 |
5 | 1003323020011000 |
6 | 22233551110212 |
7 | 2161444602512 |
oct | 352071424200 |
9 | 100085077488 |
10 | 31422032000 |
11 | 12364a10797 |
12 | 610b212368 |
13 | 2c69b88b58 |
14 | 1741253bb2 |
15 | c3d8c1a85 |
hex | 750e62880 |
31422032000 has 64 divisors (see below), whose sum is σ = 78123066840. Its totient is φ = 12568806400.
The previous prime is 31422031999. The next prime is 31422032011. The reversal of 31422032000 is 23022413.
It can be written as a sum of positive squares in 4 ways, for example, as 13805310016 + 17616721984 = 117496^2 + 132728^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-4 number, since 4×314220320004 (a number of 43 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31422032000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 965939 + ... + 997938.
Almost surely, 231422032000 is an apocalyptic number.
It is an amenable number.
31422032000 is an abundant number, since it is smaller than the sum of its proper divisors (46701034840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31422032000 is an equidigital number, since it uses as much as digits as its factorization.
31422032000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1963906 (or 1963884 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 31422032000 its reverse (23022413), we get a palindrome (31445054413).
The spelling of 31422032000 in words is "thirty-one billion, four hundred twenty-two million, thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •