Base | Representation |
---|---|
bin | 111111001011111… |
… | …1111111010011001 |
3 | 12110202120100111021 |
4 | 1332113333322121 |
5 | 13320234022223 |
6 | 550215402441 |
7 | 103353401221 |
oct | 17627777231 |
9 | 5422510437 |
10 | 2120220313 |
11 | 9988999a2 |
12 | 4b2083421 |
13 | 27a34a643 |
14 | 161831081 |
15 | c620d65d |
hex | 7e5ffe99 |
2120220313 has 2 divisors, whose sum is σ = 2120220314. Its totient is φ = 2120220312.
The previous prime is 2120220281. The next prime is 2120220329. The reversal of 2120220313 is 3130220212.
It is an a-pointer prime, because the next prime (2120220329) can be obtained adding 2120220313 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1841096464 + 279123849 = 42908^2 + 16707^2 .
It is a cyclic number.
It is not a de Polignac number, because 2120220313 - 25 = 2120220281 is a prime.
It is not a weakly prime, because it can be changed into another prime (2120220373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060110156 + 1060110157.
It is an arithmetic number, because the mean of its divisors is an integer number (1060110157).
Almost surely, 22120220313 is an apocalyptic number.
It is an amenable number.
2120220313 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120220313 is an equidigital number, since it uses as much as digits as its factorization.
2120220313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 2120220313 is about 46045.8501170301. The cubic root of 2120220313 is about 1284.6761563368.
Adding to 2120220313 its reverse (3130220212), we get a palindrome (5250440525).
The spelling of 2120220313 in words is "two billion, one hundred twenty million, two hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •