Base | Representation |
---|---|
bin | 11110101110000010000… |
… | …10010111010101001100 |
3 | 10201220110000000120021121 |
4 | 33113001002113111030 |
5 | 114243133414010220 |
6 | 2124520444210324 |
7 | 136154261440036 |
oct | 17270102272514 |
9 | 3656400016247 |
10 | 1055505610060 |
11 | 377701444300 |
12 | 1506928399a4 |
13 | 786c28648a5 |
14 | 39130050c56 |
15 | 1c6c9637eaa |
hex | f5c109754c |
1055505610060 has 72 divisors (see below), whose sum is σ = 2453914829520. Its totient is φ = 381058803840.
The previous prime is 1055505610039. The next prime is 1055505610079. The reversal of 1055505610060 is 600165055501.
It is a super-2 number, since 2×10555056100602 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1055505609998 and 1055505610025.
It is an unprimeable number.
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, 1232539 + ... + 1905298.
It is an arithmetic number, because the mean of its divisors is an integer number (34082150410).
Almost surely, 21055505610060 is an apocalyptic number.
1055505610060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1055505610060 is an abundant number, since it is smaller than the sum of its proper divisors (1398409219460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055505610060 is a wasteful number, since it uses less digits than its factorization.
1055505610060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3138007 (or 3137994 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 34.
The spelling of 1055505610060 in words is "one trillion, fifty-five billion, five hundred five million, six hundred ten thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •