Base | Representation |
---|---|
bin | 100011100110010000110110… |
… | …0001001010010010101011111 |
3 | 1112001200011220020011222220012 |
4 | 1013030201230021102111133 |
5 | 312020143040142340221 |
6 | 3025542151144313435 |
7 | 122645216534244161 |
oct | 10714415411222537 |
9 | 1461604806158805 |
10 | 313122110121311 |
11 | 908523830a5747 |
12 | 2b1511b517287b |
13 | 1059439949a28a |
14 | 5747296126931 |
15 | 263005836265b |
hex | 11cc86c25255f |
313122110121311 has 16 divisors (see below), whose sum is σ = 318722962710528. Its totient is φ = 307536666108000.
The previous prime is 313122110121287. The next prime is 313122110121341. The reversal of 313122110121311 is 113121011221313.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-313122110121311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313122110121341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 115704086 + ... + 118379388.
It is an arithmetic number, because the mean of its divisors is an integer number (19920185169408).
Almost surely, 2313122110121311 is an apocalyptic number.
313122110121311 is a deficient number, since it is larger than the sum of its proper divisors (5600852589217).
313122110121311 is a wasteful number, since it uses less digits than its factorization.
313122110121311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2678182.
The product of its (nonzero) digits is 216, while the sum is 23.
Adding to 313122110121311 its reverse (113121011221313), we get a palindrome (426243121342624).
The spelling of 313122110121311 in words is "three hundred thirteen trillion, one hundred twenty-two billion, one hundred ten million, one hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •