Base | Representation |
---|---|
bin | 1110001010000100111011… |
… | …11001011010110101011001 |
3 | 11002020020121110210102021220 |
4 | 13011002131321122311121 |
5 | 13040034001420131231 |
6 | 150114034532322253 |
7 | 6362153105016141 |
oct | 705023571326531 |
9 | 132206543712256 |
10 | 31132572036441 |
11 | 9a13282321127 |
12 | 35a984b473389 |
13 | 144aa34411465 |
14 | 798b78701921 |
15 | 38ec6a0ad896 |
hex | 1c509de5ad59 |
31132572036441 has 16 divisors (see below), whose sum is σ = 42081001848000. Its totient is φ = 20471289208128.
The previous prime is 31132572036437. The next prime is 31132572036499. The reversal of 31132572036441 is 14463027523113.
It is not a de Polignac number, because 31132572036441 - 22 = 31132572036437 is a prime.
It is a super-2 number, since 2×311325720364412 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31132572036393 and 31132572036402.
It is not an unprimeable number, because it can be changed into a prime (31132572036431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 211686766 + ... + 211833783.
It is an arithmetic number, because the mean of its divisors is an integer number (2630062615500).
Almost surely, 231132572036441 is an apocalyptic number.
It is an amenable number.
31132572036441 is a deficient number, since it is larger than the sum of its proper divisors (10948429811559).
31132572036441 is a wasteful number, since it uses less digits than its factorization.
31132572036441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 423520888.
The product of its (nonzero) digits is 362880, while the sum is 42.
Adding to 31132572036441 its reverse (14463027523113), we get a palindrome (45595599559554).
The spelling of 31132572036441 in words is "thirty-one trillion, one hundred thirty-two billion, five hundred seventy-two million, thirty-six thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •