Base | Representation |
---|---|
bin | 1101011100010001… |
… | …10000110101011101 |
3 | 200121221010012001001 |
4 | 12232020300311131 |
5 | 104234411000221 |
6 | 3152030350301 |
7 | 343555144531 |
oct | 65610606535 |
9 | 20557105031 |
10 | 7216500061 |
11 | 3073587341 |
12 | 149495b391 |
13 | 8b01195a4 |
14 | 4c65d5bc1 |
15 | 2c3832391 |
hex | 1ae230d5d |
7216500061 has 2 divisors, whose sum is σ = 7216500062. Its totient is φ = 7216500060.
The previous prime is 7216500047. The next prime is 7216500121. The reversal of 7216500061 is 1600056127.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4658062500 + 2558437561 = 68250^2 + 50581^2 .
It is an emirp because it is prime and its reverse (1600056127) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 7216500061 - 229 = 6679629149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7216500001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3608250030 + 3608250031.
It is an arithmetic number, because the mean of its divisors is an integer number (3608250031).
Almost surely, 27216500061 is an apocalyptic number.
It is an amenable number.
7216500061 is a deficient number, since it is larger than the sum of its proper divisors (1).
7216500061 is an equidigital number, since it uses as much as digits as its factorization.
7216500061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 28.
The square root of 7216500061 is about 84949.9856444955. The cubic root of 7216500061 is about 1932.4527025382.
Adding to 7216500061 its reverse (1600056127), we get a palindrome (8816556188).
The spelling of 7216500061 in words is "seven billion, two hundred sixteen million, five hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •