Base | Representation |
---|---|
bin | 1110001010000010000000… |
… | …10100101101001100100000 |
3 | 11002020002120001201222012112 |
4 | 13011001000110231030200 |
5 | 13040022243021144412 |
6 | 150113215052014452 |
7 | 6362066153031053 |
oct | 705010024551440 |
9 | 132202501658175 |
10 | 31131002131232 |
11 | 9a12647135103 |
12 | 35a9491761428 |
13 | 144a8440b4873 |
14 | 798a6a002a9a |
15 | 38ebc7356722 |
hex | 1c504052d320 |
31131002131232 has 24 divisors (see below), whose sum is σ = 61292680066800. Its totient is φ = 15564607193664.
The previous prime is 31131002131217. The next prime is 31131002131241. The reversal of 31131002131232 is 23213120013113.
It is a super-2 number, since 2×311310021312322 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31131002131198 and 31131002131207.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27367382 + ... + 28482197.
It is an arithmetic number, because the mean of its divisors is an integer number (2553861669450).
Almost surely, 231131002131232 is an apocalyptic number.
31131002131232 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
31131002131232 is a deficient number, since it is larger than the sum of its proper divisors (30161677935568).
31131002131232 is a wasteful number, since it uses less digits than its factorization.
31131002131232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55867008 (or 55867000 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 31131002131232 its reverse (23213120013113), we get a palindrome (54344122144345).
The spelling of 31131002131232 in words is "thirty-one trillion, one hundred thirty-one billion, two million, one hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •