Base | Representation |
---|---|
bin | 1001000001011101011… |
… | …01001000110111100101 |
3 | 1002122012220122021000202 |
4 | 10200232231020313211 |
5 | 20034410413330203 |
6 | 354231034520245 |
7 | 31253420655443 |
oct | 4405655106745 |
9 | 1078186567022 |
10 | 310021230053 |
11 | 10a52a9a1807 |
12 | 50101596085 |
13 | 23309040332 |
14 | 1101002db93 |
15 | 80e7362388 |
hex | 482eb48de5 |
310021230053 has 2 divisors, whose sum is σ = 310021230054. Its totient is φ = 310021230052.
The previous prime is 310021230007. The next prime is 310021230089. The reversal of 310021230053 is 350032120013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 294700236769 + 15320993284 = 542863^2 + 123778^2 .
It is a cyclic number.
It is not a de Polignac number, because 310021230053 - 232 = 305726262757 is a prime.
It is a super-2 number, since 2×3100212300532 (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 (310021236053) 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, 155010615026 + 155010615027.
It is an arithmetic number, because the mean of its divisors is an integer number (155010615027).
Almost surely, 2310021230053 is an apocalyptic number.
It is an amenable number.
310021230053 is a deficient number, since it is larger than the sum of its proper divisors (1).
310021230053 is an equidigital number, since it uses as much as digits as its factorization.
310021230053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 20.
Adding to 310021230053 its reverse (350032120013), we get a palindrome (660053350066).
The spelling of 310021230053 in words is "three hundred ten billion, twenty-one million, two hundred thirty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •