Base | Representation |
---|---|
bin | 11001000010011111010010… |
… | …11001100101100010111101 |
3 | 21012221210022211122112222020 |
4 | 30201033221121211202331 |
5 | 24204110114000104031 |
6 | 313034415412310353 |
7 | 14412014266056126 |
oct | 1441175131454275 |
9 | 235853284575866 |
10 | 55061101566141 |
11 | 165a9311437650 |
12 | 62132636123b9 |
13 | 2495316522bb8 |
14 | d84d85c6d04d |
15 | 6573eb679096 |
hex | 3213e96658bd |
55061101566141 has 64 divisors (see below), whose sum is σ = 82175959544832. Its totient is φ = 32511251520000.
The previous prime is 55061101566083. The next prime is 55061101566199. The reversal of 55061101566141 is 14166510116055.
It is an interprime number because it is at equal distance from previous prime (55061101566083) and next prime (55061101566199).
It is not a de Polignac number, because 55061101566141 - 26 = 55061101566077 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 55061101566093 and 55061101566102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55061101566041) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1611322986 + ... + 1611357156.
It is an arithmetic number, because the mean of its divisors is an integer number (1283999367888).
Almost surely, 255061101566141 is an apocalyptic number.
It is an amenable number.
55061101566141 is a deficient number, since it is larger than the sum of its proper divisors (27114857978691).
55061101566141 is a wasteful number, since it uses less digits than its factorization.
55061101566141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41834.
The product of its (nonzero) digits is 108000, while the sum is 42.
The spelling of 55061101566141 in words is "fifty-five trillion, sixty-one billion, one hundred one million, five hundred sixty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •