Base | Representation |
---|---|
bin | 1001000011101100011… |
… | …10000001000100101101 |
3 | 1002202022112021110210202 |
4 | 10201312032001010231 |
5 | 20044340040444323 |
6 | 354550054443245 |
7 | 31325230055141 |
oct | 4416616010455 |
9 | 1082275243722 |
10 | 311221031213 |
11 | 10aa96182114 |
12 | 50397363525 |
13 | 2346a795151 |
14 | 110c550b221 |
15 | 816785dd28 |
hex | 487638112d |
311221031213 has 8 divisors (see below), whose sum is σ = 322103511480. Its totient is φ = 300348599040.
The previous prime is 311221031201. The next prime is 311221031221. The reversal of 311221031213 is 312130122113.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 38912644 + 311182118569 = 6238^2 + 557837^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 311221031213 - 28 = 311221030957 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 (311221031113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2448968 + ... + 2572913.
It is an arithmetic number, because the mean of its divisors is an integer number (40262938935).
Almost surely, 2311221031213 is an apocalyptic number.
It is an amenable number.
311221031213 is a deficient number, since it is larger than the sum of its proper divisors (10882480267).
311221031213 is a wasteful number, since it uses less digits than its factorization.
311221031213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5024047.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 311221031213 its reverse (312130122113), we get a palindrome (623351153326).
The spelling of 311221031213 in words is "three hundred eleven billion, two hundred twenty-one million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •