Base | Representation |
---|---|
bin | 11101100011100111100… |
… | …101110001001100010111 |
3 | 21012011122112210200001022 |
4 | 131203213211301030113 |
5 | 231234203130021211 |
6 | 4153025024151355 |
7 | 266512541103500 |
oct | 35434745611427 |
9 | 7164575720038 |
10 | 2031110001431 |
11 | 713430710375 |
12 | 28978676855b |
13 | 1196c089c544 |
14 | 704404bbba7 |
15 | 37c792b5bdb |
hex | 1d8e7971317 |
2031110001431 has 48 divisors (see below), whose sum is σ = 2490589730304. Its totient is φ = 1648291208256.
The previous prime is 2031110001413. The next prime is 2031110001433. The reversal of 2031110001431 is 1341000111302.
It is not a de Polignac number, because 2031110001431 - 26 = 2031110001367 is a prime.
It is a super-2 number, since 2×20311100014312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2031110001433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 411736841 + ... + 411741773.
It is an arithmetic number, because the mean of its divisors is an integer number (51887286048).
Almost surely, 22031110001431 is an apocalyptic number.
2031110001431 is a deficient number, since it is larger than the sum of its proper divisors (459479728873).
2031110001431 is a wasteful number, since it uses less digits than its factorization.
2031110001431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8620 (or 8613 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 2031110001431 its reverse (1341000111302), we get a palindrome (3372110112733).
The spelling of 2031110001431 in words is "two trillion, thirty-one billion, one hundred ten million, one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •