Base | Representation |
---|---|
bin | 11101001100000001… |
… | …011101111010010111 |
3 | 2222220011011100021122 |
4 | 131030001131322113 |
5 | 1003141044133101 |
6 | 22221505434155 |
7 | 2156432336615 |
oct | 351401357227 |
9 | 88804140248 |
10 | 31340224151 |
11 | 123228152a5 |
12 | 60a793b95b |
13 | 2c55c44942 |
14 | 173443a6b5 |
15 | c3661251b |
hex | 74c05de97 |
31340224151 has 8 divisors (see below), whose sum is σ = 32139592800. Its totient is φ = 30542520960.
The previous prime is 31340224127. The next prime is 31340224159. The reversal of 31340224151 is 15142204313.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31340224151 - 210 = 31340223127 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 31340224151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31340224159) 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 7 ways as a sum of consecutive naturals, for example, 378206 + ... + 453563.
It is an arithmetic number, because the mean of its divisors is an integer number (4017449100).
Almost surely, 231340224151 is an apocalyptic number.
31340224151 is a deficient number, since it is larger than the sum of its proper divisors (799368649).
31340224151 is an equidigital number, since it uses as much as digits as its factorization.
31340224151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 832729.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 31340224151 its reverse (15142204313), we get a palindrome (46482428464).
The spelling of 31340224151 in words is "thirty-one billion, three hundred forty million, two hundred twenty-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •