Base | Representation |
---|---|
bin | 1001000011010100100… |
… | …11011101011000100101 |
3 | 1002201210121010111200022 |
4 | 10201222103131120211 |
5 | 20043432402200201 |
6 | 354514154124525 |
7 | 31320251665436 |
oct | 4415223353045 |
9 | 1081717114608 |
10 | 311021131301 |
11 | 10a9a3358381 |
12 | 50340420745 |
13 | 2343824458a |
14 | 110a6b5348d |
15 | 815502441b |
hex | 486a4dd625 |
311021131301 has 2 divisors, whose sum is σ = 311021131302. Its totient is φ = 311021131300.
The previous prime is 311021131297. The next prime is 311021131303. The reversal of 311021131301 is 103131120113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 255808350625 + 55212780676 = 505775^2 + 234974^2 .
It is a cyclic number.
It is not a de Polignac number, because 311021131301 - 22 = 311021131297 is a prime.
Together with 311021131303, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 311021131301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311021131303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155510565650 + 155510565651.
It is an arithmetic number, because the mean of its divisors is an integer number (155510565651).
Almost surely, 2311021131301 is an apocalyptic number.
It is an amenable number.
311021131301 is a deficient number, since it is larger than the sum of its proper divisors (1).
311021131301 is an equidigital number, since it uses as much as digits as its factorization.
311021131301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 311021131301 its reverse (103131120113), we get a palindrome (414152251414).
The spelling of 311021131301 in words is "three hundred eleven billion, twenty-one million, one hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •