Base | Representation |
---|---|
bin | 100011010110111111011011… |
… | …0110001010010010000101001 |
3 | 1111210020112001012211010001011 |
4 | 1012231332312301102100221 |
5 | 311231300324004104001 |
6 | 3021254014504223521 |
7 | 122340451635121135 |
oct | 10655766661222051 |
9 | 1453215035733034 |
10 | 311023123113001 |
11 | 90113190706482 |
12 | 2aa7244676aba1 |
13 | 1047147c261b50 |
14 | 56b3856d863c5 |
15 | 25e565a045d51 |
hex | 11adfb6c52429 |
311023123113001 has 32 divisors (see below), whose sum is σ = 352726425676800. Its totient is φ = 271872447174720.
The previous prime is 311023123112993. The next prime is 311023123113023. The reversal of 311023123113001 is 100311321320113.
It is a cyclic number.
It is not a de Polignac number, because 311023123113001 - 23 = 311023123112993 is a prime.
It is a super-2 number, since 2×3110231231130012 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311023123213001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6553488210 + ... + 6553535668.
It is an arithmetic number, because the mean of its divisors is an integer number (11022700802400).
Almost surely, 2311023123113001 is an apocalyptic number.
It is an amenable number.
311023123113001 is a deficient number, since it is larger than the sum of its proper divisors (41703302563799).
311023123113001 is a wasteful number, since it uses less digits than its factorization.
311023123113001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58189.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 311023123113001 its reverse (100311321320113), we get a palindrome (411334444433114).
The spelling of 311023123113001 in words is "three hundred eleven trillion, twenty-three billion, one hundred twenty-three million, one hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •