Base | Representation |
---|---|
bin | 1001000010011010000… |
… | …10000100110100000101 |
3 | 1002200112101001020010112 |
4 | 10201031002010310011 |
5 | 20041431142104244 |
6 | 354353332202405 |
7 | 31302136513601 |
oct | 4411502046405 |
9 | 1080471036115 |
10 | 310530034949 |
11 | 10a771122422 |
12 | 50223a69405 |
13 | 2338a589014 |
14 | 1105b838501 |
15 | 8126d6939e |
hex | 484d084d05 |
310530034949 has 2 divisors, whose sum is σ = 310530034950. Its totient is φ = 310530034948.
The previous prime is 310530034937. The next prime is 310530034951. The reversal of 310530034949 is 949430035013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 235218210049 + 75311824900 = 484993^2 + 274430^2 .
It is a cyclic number.
It is not a de Polignac number, because 310530034949 - 220 = 310528986373 is a prime.
It is a super-2 number, since 2×3105300349492 (a number of 24 digits) contains 22 as substring.
Together with 310530034951, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (310530034909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155265017474 + 155265017475.
It is an arithmetic number, because the mean of its divisors is an integer number (155265017475).
Almost surely, 2310530034949 is an apocalyptic number.
It is an amenable number.
310530034949 is a deficient number, since it is larger than the sum of its proper divisors (1).
310530034949 is an equidigital number, since it uses as much as digits as its factorization.
310530034949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174960, while the sum is 41.
The spelling of 310530034949 in words is "three hundred ten billion, five hundred thirty million, thirty-four thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •