Base | Representation |
---|---|
bin | 11101001100110110… |
… | …110010100110100011 |
3 | 2222221010110112000102 |
4 | 131030312302212203 |
5 | 1003203133440111 |
6 | 22223125213015 |
7 | 2156662216121 |
oct | 351466624643 |
9 | 88833415012 |
10 | 31354202531 |
11 | 1232a6a2483 |
12 | 60b056116b |
13 | 2c58aca282 |
14 | 1736238911 |
15 | c3797413b |
hex | 74cdb29a3 |
31354202531 has 16 divisors (see below), whose sum is σ = 33399397440. Its totient is φ = 29368035840.
The previous prime is 31354202491. The next prime is 31354202533. The reversal of 31354202531 is 13520245313.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31354202531 is a prime.
It is a super-2 number, since 2×313542025312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31354202494 and 31354202503.
It is not an unprimeable number, because it can be changed into a prime (31354202533) 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 15 ways as a sum of consecutive naturals, for example, 610415 + ... + 659783.
It is an arithmetic number, because the mean of its divisors is an integer number (2087462340).
Almost surely, 231354202531 is an apocalyptic number.
31354202531 is a deficient number, since it is larger than the sum of its proper divisors (2045194909).
31354202531 is a wasteful number, since it uses less digits than its factorization.
31354202531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49966.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 31354202531 its reverse (13520245313), we get a palindrome (44874447844).
The spelling of 31354202531 in words is "thirty-one billion, three hundred fifty-four million, two hundred two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •