Base | Representation |
---|---|
bin | 11110101110000111111… |
… | …01101101010001010100 |
3 | 10201220120102102122121211 |
4 | 33113003331231101110 |
5 | 114243234002031402 |
6 | 2124525400551204 |
7 | 136155426042142 |
oct | 17270375552124 |
9 | 3656512378554 |
10 | 1055554720852 |
11 | 377727137a35 |
12 | 1506a7182504 |
13 | 786cca9b328 |
14 | 39136796592 |
15 | 1c6cdad94d7 |
hex | f5c3f6d454 |
1055554720852 has 24 divisors (see below), whose sum is σ = 1848583562112. Its totient is φ = 527388139200.
The previous prime is 1055554720793. The next prime is 1055554720861. The reversal of 1055554720852 is 2580274555501.
It is a happy number.
It is a super-2 number, since 2×10555547208522 (a number of 25 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (49) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1055554720796 and 1055554720805.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 33260352 + ... + 33292072.
It is an arithmetic number, because the mean of its divisors is an integer number (77024315088).
Almost surely, 21055554720852 is an apocalyptic number.
It is an amenable number.
1055554720852 is a deficient number, since it is larger than the sum of its proper divisors (793028841260).
1055554720852 is a wasteful number, since it uses less digits than its factorization.
1055554720852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37599 (or 37597 counting only the distinct ones).
The product of its (nonzero) digits is 2800000, while the sum is 49.
The spelling of 1055554720852 in words is "one trillion, fifty-five billion, five hundred fifty-four million, seven hundred twenty thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •