Base | Representation |
---|---|
bin | 1001000011010011011… |
… | …01111101010010100001 |
3 | 1002201202220122001101001 |
4 | 10201221231331102201 |
5 | 20043422343104023 |
6 | 354513203312001 |
7 | 31320102302314 |
oct | 4415155752241 |
9 | 1081686561331 |
10 | 311011300513 |
11 | 10a998853361 |
12 | 5033907b601 |
13 | 234361b1a44 |
14 | 110a571497b |
15 | 81542316ad |
hex | 4869b7d4a1 |
311011300513 has 2 divisors, whose sum is σ = 311011300514. Its totient is φ = 311011300512.
The previous prime is 311011300493. The next prime is 311011300559. The reversal of 311011300513 is 315003110113.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 194178591649 + 116832708864 = 440657^2 + 341808^2 .
It is a cyclic number.
It is not a de Polignac number, because 311011300513 - 213 = 311011292321 is a prime.
It is not a weakly prime, because it can be changed into another prime (311011300913) 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, 155505650256 + 155505650257.
It is an arithmetic number, because the mean of its divisors is an integer number (155505650257).
Almost surely, 2311011300513 is an apocalyptic number.
It is an amenable number.
311011300513 is a deficient number, since it is larger than the sum of its proper divisors (1).
311011300513 is an equidigital number, since it uses as much as digits as its factorization.
311011300513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 19.
Adding to 311011300513 its reverse (315003110113), we get a palindrome (626014410626).
It can be divided in two parts, 311011 and 300513, that added together give a square (611524 = 7822).
The spelling of 311011300513 in words is "three hundred eleven billion, eleven million, three hundred thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •