Base | Representation |
---|---|
bin | 11101000000000110… |
… | …000101111110101110 |
3 | 2222101012121111121211 |
4 | 131000012011332232 |
5 | 1002233332012004 |
6 | 22150000345034 |
7 | 2151452366311 |
oct | 350006057656 |
9 | 88335544554 |
10 | 31140110254 |
11 | 1222a864810 |
12 | 605091517a |
13 | 2c2364a856 |
14 | 1715a28978 |
15 | c23c84504 |
hex | 740185fae |
31140110254 has 8 divisors (see below), whose sum is σ = 50956544088. Its totient is φ = 14154595560.
The previous prime is 31140110191. The next prime is 31140110263. The reversal of 31140110254 is 45201104113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 1415459557 = 31140110254 / (3 + 1 + 1 + 4 + 0 + 1 + 1 + 0 + 2 + 5 + 4).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 707729757 + ... + 707729800.
It is an arithmetic number, because the mean of its divisors is an integer number (6369568011).
Almost surely, 231140110254 is an apocalyptic number.
31140110254 is a deficient number, since it is larger than the sum of its proper divisors (19816433834).
31140110254 is a wasteful number, since it uses less digits than its factorization.
31140110254 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1415459570.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 31140110254 its reverse (45201104113), we get a palindrome (76341214367).
The spelling of 31140110254 in words is "thirty-one billion, one hundred forty million, one hundred ten thousand, two hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •