Base | Representation |
---|---|
bin | 10001101000110010… |
… | …01011101000100001 |
3 | 220102220111112221121 |
4 | 20310121023220201 |
5 | 123343022413243 |
6 | 4203332252241 |
7 | 453435520231 |
oct | 106431135041 |
9 | 26386445847 |
10 | 9468951073 |
11 | 4019a810aa |
12 | 1a03171081 |
13 | b7b983b3a |
14 | 65b807cc1 |
15 | 3a64601ed |
hex | 23464ba21 |
9468951073 has 2 divisors, whose sum is σ = 9468951074. Its totient is φ = 9468951072.
The previous prime is 9468951071. The next prime is 9468951083. The reversal of 9468951073 is 3701598649.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8024038929 + 1444912144 = 89577^2 + 38012^2 .
It is a cyclic number.
It is not a de Polignac number, because 9468951073 - 21 = 9468951071 is a prime.
It is a super-2 number, since 2×94689510732 (a number of 21 digits) contains 22 as substring.
Together with 9468951071, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 9468951073.
It is not a weakly prime, because it can be changed into another prime (9468951071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4734475536 + 4734475537.
It is an arithmetic number, because the mean of its divisors is an integer number (4734475537).
Almost surely, 29468951073 is an apocalyptic number.
It is an amenable number.
9468951073 is a deficient number, since it is larger than the sum of its proper divisors (1).
9468951073 is an equidigital number, since it uses as much as digits as its factorization.
9468951073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1632960, while the sum is 52.
The square root of 9468951073 is about 97308.5354580984. The cubic root of 9468951073 is about 2115.6019444400.
The spelling of 9468951073 in words is "nine billion, four hundred sixty-eight million, nine hundred fifty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •