Base | Representation |
---|---|
bin | 1001000100110001100… |
… | …11110000011110110000 |
3 | 1002210210222020201121112 |
4 | 10202120303300132300 |
5 | 20102032121200224 |
6 | 355123425012452 |
7 | 31345504513631 |
oct | 4423063603660 |
9 | 1083728221545 |
10 | 311801350064 |
11 | 110263808276 |
12 | 50519784128 |
13 | 23530a8c799 |
14 | 1113c60d888 |
15 | 819d79030e |
hex | 4898cf07b0 |
311801350064 has 20 divisors (see below), whose sum is σ = 605550081600. Its totient is φ = 155530361280.
The previous prime is 311801350061. The next prime is 311801350067. The reversal of 311801350064 is 460053108113.
It is an interprime number because it is at equal distance from previous prime (311801350061) and next prime (311801350067).
It is a self number, because there is not a number n which added to its sum of digits gives 311801350064.
It is not an unprimeable number, because it can be changed into a prime (311801350061) by changing a digit.
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, 23137664 + ... + 23151135.
It is an arithmetic number, because the mean of its divisors is an integer number (30277504080).
Almost surely, 2311801350064 is an apocalyptic number.
It is an amenable number.
311801350064 is a deficient number, since it is larger than the sum of its proper divisors (293748731536).
311801350064 is a wasteful number, since it uses less digits than its factorization.
311801350064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46289228 (or 46289222 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 32.
Adding to 311801350064 its reverse (460053108113), we get a palindrome (771854458177).
The spelling of 311801350064 in words is "three hundred eleven billion, eight hundred one million, three hundred fifty thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •