Base | Representation |
---|---|
bin | 1001101001000010001001… |
… | …0100011000011111010101 |
3 | 1101112101212220112000201110 |
4 | 2122100202110120133111 |
5 | 2342134414043230221 |
6 | 34313454444045233 |
7 | 2142602431156536 |
oct | 232204224303725 |
9 | 41471786460643 |
10 | 10600555055061 |
11 | 3417740a77704 |
12 | 1232560533819 |
13 | 5bb821aa607a |
14 | 2890d8dba68d |
15 | 135b288a1776 |
hex | 9a4225187d5 |
10600555055061 has 32 divisors (see below), whose sum is σ = 14898080545920. Its totient is φ = 6694266924800.
The previous prime is 10600555055053. The next prime is 10600555055089. The reversal of 10600555055061 is 16055055500601.
It is a cyclic number.
It is not a de Polignac number, because 10600555055061 - 23 = 10600555055053 is a prime.
It is a super-2 number, since 2×106005550550612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10600555055561) 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 31 ways as a sum of consecutive naturals, for example, 117724546 + ... + 117814556.
It is an arithmetic number, because the mean of its divisors is an integer number (465565017060).
Almost surely, 210600555055061 is an apocalyptic number.
It is an amenable number.
10600555055061 is a deficient number, since it is larger than the sum of its proper divisors (4297525490859).
10600555055061 is a wasteful number, since it uses less digits than its factorization.
10600555055061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115637.
The product of its (nonzero) digits is 112500, while the sum is 39.
It can be divided in two parts, 1060055 and 5055061, that added together give a palindrome (6115116).
The spelling of 10600555055061 in words is "ten trillion, six hundred billion, five hundred fifty-five million, fifty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •