Base | Representation |
---|---|
bin | 1001101011110101111111… |
… | …1100110111001010111001 |
3 | 1101201000111112100011022212 |
4 | 2122331133330313022321 |
5 | 2343432302412420141 |
6 | 34352001235224505 |
7 | 2146232012056001 |
oct | 232753774671271 |
9 | 41630445304285 |
10 | 10648833716921 |
11 | 3436166022954 |
12 | 123b994a48135 |
13 | 5c3247037cca |
14 | 28b598c6d001 |
15 | 13700207a2eb |
hex | 9af5ff372b9 |
10648833716921 has 2 divisors, whose sum is σ = 10648833716922. Its totient is φ = 10648833716920.
The previous prime is 10648833716881. The next prime is 10648833716971. The reversal of 10648833716921 is 12961733884601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5420682871696 + 5228150845225 = 2328236^2 + 2286515^2 .
It is a cyclic number.
It is not a de Polignac number, because 10648833716921 - 226 = 10648766608057 is a prime.
It is a super-2 number, since 2×106488337169212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10648833716971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5324416858460 + 5324416858461.
It is an arithmetic number, because the mean of its divisors is an integer number (5324416858461).
Almost surely, 210648833716921 is an apocalyptic number.
It is an amenable number.
10648833716921 is a deficient number, since it is larger than the sum of its proper divisors (1).
10648833716921 is an equidigital number, since it uses as much as digits as its factorization.
10648833716921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10450944, while the sum is 59.
The spelling of 10648833716921 in words is "ten trillion, six hundred forty-eight billion, eight hundred thirty-three million, seven hundred sixteen thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •