Base | Representation |
---|---|
bin | 11001001111011101001000… |
… | …00101000101001011010100 |
3 | 21021112101021110002010111010 |
4 | 30213232210011011023110 |
5 | 24233410021440132211 |
6 | 314015215331012220 |
7 | 14456135445125136 |
oct | 1447564405051324 |
9 | 237471243063433 |
10 | 55506615161556 |
11 | 16760250227909 |
12 | 628567913a070 |
13 | 24c83362a7690 |
14 | d9c76a995056 |
15 | 663cc3b124a6 |
hex | 327ba41452d4 |
55506615161556 has 96 divisors (see below), whose sum is σ = 144860118036480. Its totient is φ = 16432261432704.
The previous prime is 55506615161539. The next prime is 55506615161561. The reversal of 55506615161556 is 65516151660555.
It is a super-2 number, since 2×555066151615562 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55506615161496 and 55506615161505.
It is a congruent number.
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, 63723856 + ... + 64589031.
It is an arithmetic number, because the mean of its divisors is an integer number (1508959562880).
Almost surely, 255506615161556 is an apocalyptic number.
It is an amenable number.
55506615161556 is an abundant number, since it is smaller than the sum of its proper divisors (89353502874924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55506615161556 is a wasteful number, since it uses less digits than its factorization.
55506615161556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128313013 (or 128313011 counting only the distinct ones).
The product of its (nonzero) digits is 20250000, while the sum is 57.
The spelling of 55506615161556 in words is "fifty-five trillion, five hundred six billion, six hundred fifteen million, one hundred sixty-one thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •