Base | Representation |
---|---|
bin | 1110000110010000000111… |
… | …00010011100010111000000 |
3 | 11001202200100021121221201221 |
4 | 13003020003202130113000 |
5 | 13030410310111200412 |
6 | 145533420220204424 |
7 | 6346520661145261 |
oct | 703100342342700 |
9 | 131680307557657 |
10 | 31001133303232 |
11 | 9972563608494 |
12 | 3588288999714 |
13 | 143b518449101 |
14 | 79266a120968 |
15 | 38b625ca3b07 |
hex | 1c320389c5c0 |
31001133303232 has 28 divisors (see below), whose sum is σ = 61529541147936. Its totient is φ = 15497626872320.
The previous prime is 31001133303181. The next prime is 31001133303241. The reversal of 31001133303232 is 23230333110013.
It is a super-2 number, since 2×310011333032322 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31001133303197 and 31001133303206.
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 3 ways as a sum of consecutive naturals, for example, 45593944 + ... + 46268887.
Almost surely, 231001133303232 is an apocalyptic number.
31001133303232 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
31001133303232 is a deficient number, since it is larger than the sum of its proper divisors (30528407844704).
31001133303232 is an equidigital number, since it uses as much as digits as its factorization.
31001133303232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91868116 (or 91868106 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 31001133303232 its reverse (23230333110013), we get a palindrome (54231466413245).
The spelling of 31001133303232 in words is "thirty-one trillion, one billion, one hundred thirty-three million, three hundred three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •