Base | Representation |
---|---|
bin | 1110001010010011001001… |
… | …10100001111111101000001 |
3 | 11002020222022101021022102120 |
4 | 13011021210310033331001 |
5 | 13040200114301030213 |
6 | 150121340134434453 |
7 | 6362543202221364 |
oct | 705114464177501 |
9 | 132228271238376 |
10 | 31140204314433 |
11 | 9a1653956a595 |
12 | 35ab21b502a29 |
13 | 144b67c704a96 |
14 | 7992a02080db |
15 | 39006516e423 |
hex | 1c5264d0ff41 |
31140204314433 has 32 divisors (see below), whose sum is σ = 41717217024000. Its totient is φ = 20661936734400.
The previous prime is 31140204314411. The next prime is 31140204314449. The reversal of 31140204314433 is 33441340204113.
It is not a de Polignac number, because 31140204314433 - 26 = 31140204314369 is a prime.
It is a super-2 number, since 2×311402043144332 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31140204314394 and 31140204314403.
It is not an unprimeable number, because it can be changed into a prime (31140204314833) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1559105035 + ... + 1559125007.
It is an arithmetic number, because the mean of its divisors is an integer number (1303663032000).
Almost surely, 231140204314433 is an apocalyptic number.
It is an amenable number.
31140204314433 is a deficient number, since it is larger than the sum of its proper divisors (10577012709567).
31140204314433 is a wasteful number, since it uses less digits than its factorization.
31140204314433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23269.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 31140204314433 its reverse (33441340204113), we get a palindrome (64581544518546).
The spelling of 31140204314433 in words is "thirty-one trillion, one hundred forty billion, two hundred four million, three hundred fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •