Base | Representation |
---|---|
bin | 1101001010011100… |
… | …11100111001101011 |
3 | 200020111210121110212 |
4 | 12211032130321223 |
5 | 103433122340311 |
6 | 3125130131335 |
7 | 340061322563 |
oct | 64516347153 |
9 | 20214717425 |
10 | 7066996331 |
11 | 2aa7153a3a |
12 | 1452880b4b |
13 | 888162545 |
14 | 4b07d9da3 |
15 | 2b564ec8b |
hex | 1a539ce6b |
7066996331 has 2 divisors, whose sum is σ = 7066996332. Its totient is φ = 7066996330.
The previous prime is 7066996297. The next prime is 7066996351. The reversal of 7066996331 is 1336996607.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (1336996607) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 7066996331 - 230 = 5993254507 is a prime.
It is a super-2 number, since 2×70669963312 = 99884874284734923122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 7066996331.
It is not a weakly prime, because it can be changed into another prime (7066996351) 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, 3533498165 + 3533498166.
It is an arithmetic number, because the mean of its divisors is an integer number (3533498166).
Almost surely, 27066996331 is an apocalyptic number.
7066996331 is a deficient number, since it is larger than the sum of its proper divisors (1).
7066996331 is an equidigital number, since it uses as much as digits as its factorization.
7066996331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1102248, while the sum is 50.
The square root of 7066996331 is about 84065.4288694229. The cubic root of 7066996331 is about 1919.0146429587.
The spelling of 7066996331 in words is "seven billion, sixty-six million, nine hundred ninety-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •