Base | Representation |
---|---|
bin | 1001000111000011000… |
… | …00111000110011111101 |
3 | 1002220221222111111010202 |
4 | 10203201200320303331 |
5 | 20112031402441341 |
6 | 355444441213245 |
7 | 31420645535306 |
oct | 4434140706375 |
9 | 1086858444122 |
10 | 313021140221 |
11 | 11082a300709 |
12 | 507ba191225 |
13 | 236966c29ca |
14 | 112166117ad |
15 | 82208d979b |
hex | 48e1838cfd |
313021140221 has 2 divisors, whose sum is σ = 313021140222. Its totient is φ = 313021140220.
The previous prime is 313021140143. The next prime is 313021140251. The reversal of 313021140221 is 122041120313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 312978708025 + 42432196 = 559445^2 + 6514^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-313021140221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 313021140193 and 313021140202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313021140251) 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, 156510570110 + 156510570111.
It is an arithmetic number, because the mean of its divisors is an integer number (156510570111).
Almost surely, 2313021140221 is an apocalyptic number.
It is an amenable number.
313021140221 is a deficient number, since it is larger than the sum of its proper divisors (1).
313021140221 is an equidigital number, since it uses as much as digits as its factorization.
313021140221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 313021140221 its reverse (122041120313), we get a palindrome (435062260534).
The spelling of 313021140221 in words is "three hundred thirteen billion, twenty-one million, one hundred forty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •