Base | Representation |
---|---|
bin | 1001000011110111010… |
… | …01011011011001011001 |
3 | 1002202112212122101210221 |
4 | 10201323221123121121 |
5 | 20100031344244001 |
6 | 355003110440041 |
7 | 31330414133434 |
oct | 4417351333131 |
9 | 1082485571727 |
10 | 311312103001 |
11 | 110032625759 |
12 | 50401963021 |
13 | 23483600b93 |
14 | 110d365681b |
15 | 817084d1a1 |
hex | 487ba5b659 |
311312103001 has 4 divisors (see below), whose sum is σ = 311314046004. Its totient is φ = 311310160000.
The previous prime is 311312102989. The next prime is 311312103023. The reversal of 311312103001 is 100301213113.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100301213113 = 10253 ⋅9782621.
It can be written as a sum of positive squares in 2 ways, for example, as 70981747776 + 240330355225 = 266424^2 + 490235^2 .
It is a cyclic number.
It is not a de Polignac number, because 311312103001 - 227 = 311177885273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311312103031) 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, 707200 + ... + 1059601.
It is an arithmetic number, because the mean of its divisors is an integer number (77828511501).
Almost surely, 2311312103001 is an apocalyptic number.
It is an amenable number.
311312103001 is a deficient number, since it is larger than the sum of its proper divisors (1943003).
311312103001 is a wasteful number, since it uses less digits than its factorization.
311312103001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1943002.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 311312103001 its reverse (100301213113), we get a palindrome (411613316114).
The spelling of 311312103001 in words is "three hundred eleven billion, three hundred twelve million, one hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •