Base | Representation |
---|---|
bin | 11100111000011110… |
… | …111010101110100000 |
3 | 2222001022022011010121 |
4 | 130320132322232200 |
5 | 1002003133300112 |
6 | 22125155210024 |
7 | 2145342023305 |
oct | 347036725640 |
9 | 88038264117 |
10 | 31012400032 |
11 | 12174767179 |
12 | 6015ba6914 |
13 | 2c03054383 |
14 | 1702aa30ac |
15 | c17959407 |
hex | 7387baba0 |
31012400032 has 12 divisors (see below), whose sum is σ = 61055662626. Its totient is φ = 15506200000.
The previous prime is 31012400021. The next prime is 31012400033. The reversal of 31012400032 is 23000421013.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 17721999376 + 13290400656 = 133124^2 + 115284^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 31012399979 and 31012400015.
It is not an unprimeable number, because it can be changed into a prime (31012400033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 484568719 + ... + 484568782.
Almost surely, 231012400032 is an apocalyptic number.
31012400032 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
31012400032 is a deficient number, since it is larger than the sum of its proper divisors (30043262594).
31012400032 is an equidigital number, since it uses as much as digits as its factorization.
31012400032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 969137511 (or 969137503 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 31012400032 its reverse (23000421013), we get a palindrome (54012821045).
The spelling of 31012400032 in words is "thirty-one billion, twelve million, four hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •