Base | Representation |
---|---|
bin | 110011010010011110… |
… | …010011001000000000 |
3 | 12021010222100202022000 |
4 | 303102132103020000 |
5 | 1400241103444233 |
6 | 41144341344000 |
7 | 3656463532560 |
oct | 632236231000 |
9 | 167128322260 |
10 | 55070765568 |
11 | 213a00142a5 |
12 | a80b108000 |
13 | 5268477720 |
14 | 2945d72da0 |
15 | 1674b28d13 |
hex | cd2793200 |
55070765568 has 320 divisors, whose sum is σ = 200636325120. Its totient is φ = 14523826176.
The previous prime is 55070765543. The next prime is 55070765587. The reversal of 55070765568 is 86556707055.
55070765568 is a `hidden beast` number, since 5 + 5 + 0 + 7 + 0 + 76 + 5 + 568 = 666.
It is a super-2 number, since 2×550707655682 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1236096 + ... + 1279872.
It is an arithmetic number, because the mean of its divisors is an integer number (626988516).
Almost surely, 255070765568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55070765568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100318162560).
55070765568 is an abundant number, since it is smaller than the sum of its proper divisors (145565559552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55070765568 is a wasteful number, since it uses less digits than its factorization.
55070765568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43824 (or 43802 counting only the distinct ones).
The product of its (nonzero) digits is 8820000, while the sum is 54.
The spelling of 55070765568 in words is "fifty-five billion, seventy million, seven hundred sixty-five thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •