Base | Representation |
---|---|
bin | 11101001001101101… |
… | …000110110010100011 |
3 | 2222210102222102110110 |
4 | 131021231012302203 |
5 | 1003101120112011 |
6 | 22214000102403 |
7 | 2155450635036 |
oct | 351155066243 |
9 | 88712872413 |
10 | 31301332131 |
11 | 12302871133 |
12 | 6096904a03 |
13 | 2c4ab78504 |
14 | 172d1d501d |
15 | c32ecdba6 |
hex | 749b46ca3 |
31301332131 has 4 divisors (see below), whose sum is σ = 41735109512. Its totient is φ = 20867554752.
The previous prime is 31301332099. The next prime is 31301332133. The reversal of 31301332131 is 13123310313.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13123310313 = 3 ⋅4374436771.
It is not a de Polignac number, because 31301332131 - 25 = 31301332099 is a prime.
It is a super-2 number, since 2×313013321312 (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 = 31301332098 and 31301332107.
It is not an unprimeable number, because it can be changed into a prime (31301332133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5216888686 + ... + 5216888691.
It is an arithmetic number, because the mean of its divisors is an integer number (10433777378).
Almost surely, 231301332131 is an apocalyptic number.
31301332131 is a deficient number, since it is larger than the sum of its proper divisors (10433777381).
31301332131 is a wasteful number, since it uses less digits than its factorization.
31301332131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10433777380.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 31301332131 its reverse (13123310313), we get a palindrome (44424642444).
The spelling of 31301332131 in words is "thirty-one billion, three hundred one million, three hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •