Base | Representation |
---|---|
bin | 1101011101000010… |
… | …11010000000000101 |
3 | 200122101021101120222 |
4 | 12232201122000011 |
5 | 104243034211013 |
6 | 3152421034125 |
7 | 343664101544 |
oct | 65641320005 |
9 | 20571241528 |
10 | 7222960133 |
11 | 3077199944 |
12 | 1496b55945 |
13 | 8b156bb0c |
14 | 4c73d815b |
15 | 2c41ab508 |
hex | 1ae85a005 |
7222960133 has 2 divisors, whose sum is σ = 7222960134. Its totient is φ = 7222960132.
The previous prime is 7222960061. The next prime is 7222960177. The reversal of 7222960133 is 3310692227.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6972751009 + 250209124 = 83503^2 + 15818^2 .
It is a cyclic number.
It is not a de Polignac number, because 7222960133 - 210 = 7222959109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 7222960093 and 7222960102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7222960183) 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, 3611480066 + 3611480067.
It is an arithmetic number, because the mean of its divisors is an integer number (3611480067).
Almost surely, 27222960133 is an apocalyptic number.
It is an amenable number.
7222960133 is a deficient number, since it is larger than the sum of its proper divisors (1).
7222960133 is an equidigital number, since it uses as much as digits as its factorization.
7222960133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 35.
The square root of 7222960133 is about 84987.9999352850. Note that the first 4 decimals coincide. The cubic root of 7222960133 is about 1933.0291620528.
The spelling of 7222960133 in words is "seven billion, two hundred twenty-two million, nine hundred sixty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •