Base | Representation |
---|---|
bin | 1000101000000101000100… |
… | …0110100100000111110001 |
3 | 1020120201112110101202101002 |
4 | 2022001101012210013301 |
5 | 2220344030001334011 |
6 | 32101104245051345 |
7 | 1666146300515522 |
oct | 212012106440761 |
9 | 36521473352332 |
10 | 9484648464881 |
11 | 3027464881017 |
12 | 10922316b6b55 |
13 | 53a5246bb875 |
14 | 24b0b9138849 |
15 | 116ab670bc3b |
hex | 8a0511a41f1 |
9484648464881 has 2 divisors, whose sum is σ = 9484648464882. Its totient is φ = 9484648464880.
The previous prime is 9484648464847. The next prime is 9484648464919. The reversal of 9484648464881 is 1884648464849.
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., 9096165520225 + 388482944656 = 3015985^2 + 623284^2 .
It is a cyclic number.
It is not a de Polignac number, because 9484648464881 - 26 = 9484648464817 is a prime.
It is a super-2 number, since 2×94846484648812 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 9484648464799 and 9484648464808.
It is not a weakly prime, because it can be changed into another prime (9484648461881) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4742324232440 + 4742324232441.
It is an arithmetic number, because the mean of its divisors is an integer number (4742324232441).
Almost surely, 29484648464881 is an apocalyptic number.
It is an amenable number.
9484648464881 is a deficient number, since it is larger than the sum of its proper divisors (1).
9484648464881 is an equidigital number, since it uses as much as digits as its factorization.
9484648464881 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1358954496, while the sum is 74.
The spelling of 9484648464881 in words is "nine trillion, four hundred eighty-four billion, six hundred forty-eight million, four hundred sixty-four thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •