Base | Representation |
---|---|
bin | 11110101111000010111… |
… | …11000100100000100111 |
3 | 10201221211221101202012020 |
4 | 33113201133010200213 |
5 | 114300242300143210 |
6 | 2125050452354223 |
7 | 136203621641262 |
oct | 17274137044047 |
9 | 3657757352166 |
10 | 1056050006055 |
11 | 377960774050 |
12 | 150805015973 |
13 | 7877b5923b5 |
14 | 39182481cd9 |
15 | 1c70c320770 |
hex | f5e17c4827 |
1056050006055 has 64 divisors (see below), whose sum is σ = 1914413875200. Its totient is φ = 492636168320.
The previous prime is 1056050006023. The next prime is 1056050006069. The reversal of 1056050006055 is 5506000506501.
It is not a de Polignac number, because 1056050006055 - 25 = 1056050006023 is a prime.
It is a super-2 number, since 2×10560500060552 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 696495 + ... + 1611584.
It is an arithmetic number, because the mean of its divisors is an integer number (29912716800).
Almost surely, 21056050006055 is an apocalyptic number.
1056050006055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1056050006055 is a deficient number, since it is larger than the sum of its proper divisors (858363869145).
1056050006055 is a wasteful number, since it uses less digits than its factorization.
1056050006055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2308204.
The product of its (nonzero) digits is 22500, while the sum is 33.
The spelling of 1056050006055 in words is "one trillion, fifty-six billion, fifty million, six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •