Base | Representation |
---|---|
bin | 1001101010001111110100… |
… | …0011101011011010100001 |
3 | 1101121101200221220120000011 |
4 | 2122203331003223122201 |
5 | 2343010114104134432 |
6 | 34331223405324521 |
7 | 2144241211536535 |
oct | 232437503533241 |
9 | 41541627816004 |
10 | 10621404755617 |
11 | 34255700a3297 |
12 | 12365bab66741 |
13 | 5c07955158a6 |
14 | 28a116087bc5 |
15 | 136449010847 |
hex | 9a8fd0eb6a1 |
10621404755617 has 2 divisors, whose sum is σ = 10621404755618. Its totient is φ = 10621404755616.
The previous prime is 10621404755587. The next prime is 10621404755653. The reversal of 10621404755617 is 71655740412601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10221678602496 + 399726153121 = 3197136^2 + 632239^2 .
It is a cyclic number.
It is not a de Polignac number, because 10621404755617 - 211 = 10621404753569 is a prime.
It is a super-2 number, since 2×106214047556172 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10621404752617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5310702377808 + 5310702377809.
It is an arithmetic number, because the mean of its divisors is an integer number (5310702377809).
Almost surely, 210621404755617 is an apocalyptic number.
It is an amenable number.
10621404755617 is a deficient number, since it is larger than the sum of its proper divisors (1).
10621404755617 is an equidigital number, since it uses as much as digits as its factorization.
10621404755617 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1411200, while the sum is 49.
The spelling of 10621404755617 in words is "ten trillion, six hundred twenty-one billion, four hundred four million, seven hundred fifty-five thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •