Base | Representation |
---|---|
bin | 1001000011110101110… |
… | …11010110000000100111 |
3 | 1002202112000220122012222 |
4 | 10201322323112000213 |
5 | 20100020301203221 |
6 | 355001555502555 |
7 | 31330206346655 |
oct | 4417273260047 |
9 | 1082460818188 |
10 | 311300022311 |
11 | 110026824313 |
12 | 503b98b7a5b |
13 | 23480c61245 |
14 | 110d1bcddd5 |
15 | 816e7639ab |
hex | 487aed6027 |
311300022311 has 4 divisors (see below), whose sum is σ = 318892705824. Its totient is φ = 303707338800.
The previous prime is 311300022307. The next prime is 311300022367. The reversal of 311300022311 is 113220003113.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 311300022311 - 22 = 311300022307 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 311300022311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311300022211) 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 in 3 ways as a sum of consecutive naturals, for example, 3796341695 + ... + 3796341776.
It is an arithmetic number, because the mean of its divisors is an integer number (79723176456).
Almost surely, 2311300022311 is an apocalyptic number.
311300022311 is a deficient number, since it is larger than the sum of its proper divisors (7592683513).
311300022311 is an equidigital number, since it uses as much as digits as its factorization.
311300022311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7592683512.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 311300022311 its reverse (113220003113), we get a palindrome (424520025424).
The spelling of 311300022311 in words is "three hundred eleven billion, three hundred million, twenty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •