Base | Representation |
---|---|
bin | 110010111110111011110… |
… | …1001100111001000001001 |
3 | 220210212112210002102100022 |
4 | 1211331313221213020021 |
5 | 1404301014324303044 |
6 | 22523003350550225 |
7 | 1322150306152316 |
oct | 145756751471011 |
9 | 26725483072308 |
10 | 7007099056649 |
11 | 226176a81970a |
12 | 952033368375 |
13 | 3ba9c7304873 |
14 | 1a3206db9d0d |
15 | c240da833ee |
hex | 65f77a67209 |
7007099056649 has 2 divisors, whose sum is σ = 7007099056650. Its totient is φ = 7007099056648.
The previous prime is 7007099056631. The next prime is 7007099056693. The reversal of 7007099056649 is 9466509907007.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4115347791424 + 2891751265225 = 2028632^2 + 1700515^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-7007099056649 is a prime.
It is a super-2 number, since 2×70070990566492 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 7007099056591 and 7007099056600.
It is not a weakly prime, because it can be changed into another prime (7007099056549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3503549528324 + 3503549528325.
It is an arithmetic number, because the mean of its divisors is an integer number (3503549528325).
Almost surely, 27007099056649 is an apocalyptic number.
It is an amenable number.
7007099056649 is a deficient number, since it is larger than the sum of its proper divisors (1).
7007099056649 is an equidigital number, since it uses as much as digits as its factorization.
7007099056649 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25719120, while the sum is 62.
The spelling of 7007099056649 in words is "seven trillion, seven billion, ninety-nine million, fifty-six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •