Base | Representation |
---|---|
bin | 1001000011110110001… |
… | …11001011000001000101 |
3 | 1002202112020202011120210 |
4 | 10201323013023001011 |
5 | 20100022044414023 |
6 | 355002150150033 |
7 | 31330244612631 |
oct | 4417307130105 |
9 | 1082466664523 |
10 | 311303123013 |
11 | 110028551983 |
12 | 503ba952319 |
13 | 234817a868c |
14 | 110d2399dc1 |
15 | 816eb77593 |
hex | 487b1cb045 |
311303123013 has 8 divisors (see below), whose sum is σ = 415088092576. Its totient is φ = 207526784400.
The previous prime is 311303122997. The next prime is 311303123051. The reversal of 311303123013 is 310321303113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 311303123013 - 24 = 311303122997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311303127013) 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 7 ways as a sum of consecutive naturals, for example, 2073103 + ... + 2218188.
It is an arithmetic number, because the mean of its divisors is an integer number (51886011572).
Almost surely, 2311303123013 is an apocalyptic number.
It is an amenable number.
311303123013 is a deficient number, since it is larger than the sum of its proper divisors (103784969563).
311303123013 is a wasteful number, since it uses less digits than its factorization.
311303123013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4315475.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 311303123013 its reverse (310321303113), we get a palindrome (621624426126).
The spelling of 311303123013 in words is "three hundred eleven billion, three hundred three million, one hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •