Base | Representation |
---|---|
bin | 1001100110011000101010… |
… | …1000011011100010000011 |
3 | 1101101001110022111012111022 |
4 | 2121212022220123202003 |
5 | 2340413230442004421 |
6 | 34240532225540055 |
7 | 2136402144634544 |
oct | 231461250334203 |
9 | 41331408435438 |
10 | 10555060500611 |
11 | 33aa415534580 |
12 | 12257844a462b |
13 | 5b7451598673 |
14 | 286c20bb24cb |
15 | 1348648237ab |
hex | 9998aa1b883 |
10555060500611 has 24 divisors (see below), whose sum is σ = 11632751007744. Its totient is φ = 9498050100000.
The previous prime is 10555060500587. The next prime is 10555060500629. The reversal of 10555060500611 is 11600506055501.
It is not a de Polignac number, because 10555060500611 - 230 = 10553986758787 is a prime.
It is a super-2 number, since 2×105550605006112 (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 (10555060500671) 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 in 23 ways as a sum of consecutive naturals, for example, 542081606 + ... + 542101076.
It is an arithmetic number, because the mean of its divisors is an integer number (484697958656).
Almost surely, 210555060500611 is an apocalyptic number.
10555060500611 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10555060500611 is a deficient number, since it is larger than the sum of its proper divisors (1077690507133).
10555060500611 is a wasteful number, since it uses less digits than its factorization.
10555060500611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24515 (or 24414 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 35.
The spelling of 10555060500611 in words is "ten trillion, five hundred fifty-five billion, sixty million, five hundred thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •