Base | Representation |
---|---|
bin | 10010000100001111… |
… | …01010100010001001 |
3 | 221000221211110001211 |
4 | 21002013222202021 |
5 | 124331001140243 |
6 | 4242240213121 |
7 | 462233115565 |
oct | 110207524211 |
9 | 27027743054 |
10 | 9699240073 |
11 | 4127a71696 |
12 | 1a6830a1a1 |
13 | bb75b4813 |
14 | 6802326a5 |
15 | 3bb79dd9d |
hex | 2421ea889 |
9699240073 has 2 divisors, whose sum is σ = 9699240074. Its totient is φ = 9699240072.
The previous prime is 9699240029. The next prime is 9699240077. The reversal of 9699240073 is 3700429969.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9640686969 + 58553104 = 98187^2 + 7652^2 .
It is an emirp because it is prime and its reverse (3700429969) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9699240073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 9699239999 and 9699240026.
It is not a weakly prime, because it can be changed into another prime (9699240077) 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, 4849620036 + 4849620037.
It is an arithmetic number, because the mean of its divisors is an integer number (4849620037).
Almost surely, 29699240073 is an apocalyptic number.
It is an amenable number.
9699240073 is a deficient number, since it is larger than the sum of its proper divisors (1).
9699240073 is an equidigital number, since it uses as much as digits as its factorization.
9699240073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 734832, while the sum is 49.
The square root of 9699240073 is about 98484.7199975712. The cubic root of 9699240073 is about 2132.6155407712.
The spelling of 9699240073 in words is "nine billion, six hundred ninety-nine million, two hundred forty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •