Base | Representation |
---|---|
bin | 1001100110011110001101… |
… | …1011001100000100010001 |
3 | 1101101012022010121212002122 |
4 | 2121213203123030010101 |
5 | 2340424303322422432 |
6 | 34241340123224025 |
7 | 2136454104116300 |
oct | 231474333140421 |
9 | 41335263555078 |
10 | 10556550201617 |
11 | 340000a41aa32 |
12 | 1225b1b378015 |
13 | 5b762b0c2c54 |
14 | 286d22994437 |
15 | 1349004d6612 |
hex | 999e36cc111 |
10556550201617 has 12 divisors (see below), whose sum is σ = 12291556098420. Its totient is φ = 9040007130336.
The previous prime is 10556550201551. The next prime is 10556550201623. The reversal of 10556550201617 is 71610205565501.
It can be written as a sum of positive squares in 2 ways, for example, as 5011862760961 + 5544687440656 = 2238719^2 + 2354716^2 .
It is not a de Polignac number, because 10556550201617 - 210 = 10556550200593 is a prime.
It is a super-2 number, since 2×105565502016172 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10556550201677) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 100714598 + ... + 100819359.
It is an arithmetic number, because the mean of its divisors is an integer number (1024296341535).
Almost surely, 210556550201617 is an apocalyptic number.
It is an amenable number.
10556550201617 is a deficient number, since it is larger than the sum of its proper divisors (1735005896803).
10556550201617 is a wasteful number, since it uses less digits than its factorization.
10556550201617 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201535040 (or 201535033 counting only the distinct ones).
The product of its (nonzero) digits is 315000, while the sum is 44.
The spelling of 10556550201617 in words is "ten trillion, five hundred fifty-six billion, five hundred fifty million, two hundred one thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •