Base | Representation |
---|---|
bin | 1001111100001111000011… |
… | …0000100100111000010001 |
3 | 1102200221100212211201200021 |
4 | 2133003300300210320101 |
5 | 2413041013113114313 |
6 | 35125212323023441 |
7 | 2205461252412463 |
oct | 237036060447021 |
9 | 42627325751607 |
10 | 10930436066833 |
11 | 3534632227358 |
12 | 1286484b0ab81 |
13 | 61397443851a |
14 | 29b070832133 |
15 | 13e4d44d378d |
hex | 9f0f0c24e11 |
10930436066833 has 2 divisors, whose sum is σ = 10930436066834. Its totient is φ = 10930436066832.
The previous prime is 10930436066617. The next prime is 10930436066917. The reversal of 10930436066833 is 33866063403901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9913127814144 + 1017308252689 = 3148512^2 + 1008617^2 .
It is a cyclic number.
It is not a de Polignac number, because 10930436066833 - 229 = 10929899195921 is a prime.
It is a super-2 number, since 2×109304360668332 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10930436046833) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5465218033416 + 5465218033417.
It is an arithmetic number, because the mean of its divisors is an integer number (5465218033417).
Almost surely, 210930436066833 is an apocalyptic number.
It is an amenable number.
10930436066833 is a deficient number, since it is larger than the sum of its proper divisors (1).
10930436066833 is an equidigital number, since it uses as much as digits as its factorization.
10930436066833 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5038848, while the sum is 52.
The spelling of 10930436066833 in words is "ten trillion, nine hundred thirty billion, four hundred thirty-six million, sixty-six thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.262 sec. • engine limits •