Base | Representation |
---|---|
bin | 1001000011010100110… |
… | …11110110101100000101 |
3 | 1002201210202021022121102 |
4 | 10201222123312230011 |
5 | 20043433433111401 |
6 | 354514313225445 |
7 | 31320306462656 |
oct | 4415233665405 |
9 | 1081722238542 |
10 | 311023332101 |
11 | 10a9a4620919 |
12 | 50341102285 |
13 | 23438835221 |
14 | 110a716752d |
15 | 815530b56b |
hex | 486a6f6b05 |
311023332101 has 2 divisors, whose sum is σ = 311023332102. Its totient is φ = 311023332100.
The previous prime is 311023332097. The next prime is 311023332157. The reversal of 311023332101 is 101233320113.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 184857002500 + 126166329601 = 429950^2 + 355199^2 .
It is a cyclic number.
It is not a de Polignac number, because 311023332101 - 22 = 311023332097 is a prime.
It is a super-2 number, since 2×3110233321012 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311023332161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155511666050 + 155511666051.
It is an arithmetic number, because the mean of its divisors is an integer number (155511666051).
Almost surely, 2311023332101 is an apocalyptic number.
It is an amenable number.
311023332101 is a deficient number, since it is larger than the sum of its proper divisors (1).
311023332101 is an equidigital number, since it uses as much as digits as its factorization.
311023332101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 311023332101 its reverse (101233320113), we get a palindrome (412256652214).
The spelling of 311023332101 in words is "three hundred eleven billion, twenty-three million, three hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •