Base | Representation |
---|---|
bin | 1110001010110000… |
… | …01100011011011101 |
3 | 201122002211020022012 |
4 | 13011120030123131 |
5 | 111034220434323 |
6 | 3254440001005 |
7 | 356331341066 |
oct | 70530143335 |
9 | 21562736265 |
10 | 7606421213 |
11 | 3253698926 |
12 | 1583460165 |
13 | 942b3c471 |
14 | 5222d556d |
15 | 2e7ba4678 |
hex | 1c560c6dd |
7606421213 has 2 divisors, whose sum is σ = 7606421214. Its totient is φ = 7606421212.
The previous prime is 7606421189. The next prime is 7606421233. The reversal of 7606421213 is 3121246067.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3874066564 + 3732354649 = 62242^2 + 61093^2 .
It is a cyclic number.
It is not a de Polignac number, because 7606421213 - 232 = 3311453917 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 7606421213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7606421233) 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, 3803210606 + 3803210607.
It is an arithmetic number, because the mean of its divisors is an integer number (3803210607).
Almost surely, 27606421213 is an apocalyptic number.
It is an amenable number.
7606421213 is a deficient number, since it is larger than the sum of its proper divisors (1).
7606421213 is an equidigital number, since it uses as much as digits as its factorization.
7606421213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 32.
The square root of 7606421213 is about 87214.7992774162. The cubic root of 7606421213 is about 1966.6487047132.
The spelling of 7606421213 in words is "seven billion, six hundred six million, four hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •