Base | Representation |
---|---|
bin | 11101010010000010… |
… | …010100101111011111 |
3 | 10000011011222222102210 |
4 | 131102002110233133 |
5 | 1003342411041111 |
6 | 22235512051503 |
7 | 2162066020440 |
oct | 352202245737 |
9 | 100134888383 |
10 | 31441112031 |
11 | 1237476290a |
12 | 6115693b93 |
13 | 2c70b09604 |
14 | 17439bd2c7 |
15 | c403e00a6 |
hex | 752094bdf |
31441112031 has 32 divisors (see below), whose sum is σ = 49113082368. Its totient is φ = 17515906560.
The previous prime is 31441112029. The next prime is 31441112047. The reversal of 31441112031 is 13021114413.
It is not a de Polignac number, because 31441112031 - 21 = 31441112029 is a prime.
It is a super-2 number, since 2×314411120312 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 31441111989 and 31441112007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31441112081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1299315 + ... + 1323291.
It is an arithmetic number, because the mean of its divisors is an integer number (1534783824).
Almost surely, 231441112031 is an apocalyptic number.
31441112031 is a deficient number, since it is larger than the sum of its proper divisors (17671970337).
31441112031 is a wasteful number, since it uses less digits than its factorization.
31441112031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25551.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 31441112031 its reverse (13021114413), we get a palindrome (44462226444).
The spelling of 31441112031 in words is "thirty-one billion, four hundred forty-one million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •