Base | Representation |
---|---|
bin | 11110101110000010101… |
… | …01001110100110101111 |
3 | 10201220110100022210112120 |
4 | 33113001111032212233 |
5 | 114243141200230210 |
6 | 2124521142204023 |
7 | 136154351453655 |
oct | 17270125164657 |
9 | 3656410283476 |
10 | 1055510555055 |
11 | 377704211580 |
12 | 150694423613 |
13 | 786c38a6618 |
14 | 3913097add5 |
15 | 1c6c9cb3270 |
hex | f5c154e9af |
1055510555055 has 64 divisors (see below), whose sum is σ = 1863167394816. Its totient is φ = 505992960000.
The previous prime is 1055510555053. The next prime is 1055510555101. The reversal of 1055510555055 is 5505550155501.
It is not a de Polignac number, because 1055510555055 - 21 = 1055510555053 is a prime.
It is a super-2 number, since 2×10555105550552 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1055510554998 and 1055510555016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055510555051) 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 in 63 ways as a sum of consecutive naturals, for example, 12071895 + ... + 12159015.
It is an arithmetic number, because the mean of its divisors is an integer number (29111990544).
Almost surely, 21055510555055 is an apocalyptic number.
1055510555055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1055510555055 is a deficient number, since it is larger than the sum of its proper divisors (807656839761).
1055510555055 is a wasteful number, since it uses less digits than its factorization.
1055510555055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87968.
The product of its (nonzero) digits is 390625, while the sum is 42.
The spelling of 1055510555055 in words is "one trillion, fifty-five billion, five hundred ten million, five hundred fifty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •