Base | Representation |
---|---|
bin | 11001001111011011111110… |
… | …11010110111101110111001 |
3 | 21021112022200120202121111201 |
4 | 30213231333122313232321 |
5 | 24233402242012213130 |
6 | 314015034320254201 |
7 | 14456114266255300 |
oct | 1447557732675671 |
9 | 237468616677451 |
10 | 55506000116665 |
11 | 1675aa6503354a |
12 | 6285527171361 |
13 | 24c8268a41ba7 |
14 | d9c70d013437 |
15 | 663c89b21bca |
hex | 327b7f6b7bb9 |
55506000116665 has 12 divisors (see below), whose sum is σ = 77481845061156. Its totient is φ = 38061257222688.
The previous prime is 55506000116663. The next prime is 55506000116737. The reversal of 55506000116665 is 56661100060555.
It can be written as a sum of positive squares in 2 ways, for example, as 17625655717264 + 37880344399401 = 4198292^2 + 6154701^2 .
It is not a de Polignac number, because 55506000116665 - 21 = 55506000116663 is a prime.
It is a super-2 number, since 2×555060001166652 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55506000116663) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 113277551014 + ... + 113277551503.
It is an arithmetic number, because the mean of its divisors is an integer number (6456820421763).
Almost surely, 255506000116665 is an apocalyptic number.
It is an amenable number.
55506000116665 is a deficient number, since it is larger than the sum of its proper divisors (21975844944491).
55506000116665 is a wasteful number, since it uses less digits than its factorization.
55506000116665 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 226555102536 (or 226555102529 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 46.
The spelling of 55506000116665 in words is "fifty-five trillion, five hundred six billion, one hundred sixteen thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •