Base | Representation |
---|---|
bin | 11001001111011011111110… |
… | …11110010000101000110111 |
3 | 21021112022200122102202020010 |
4 | 30213231333132100220313 |
5 | 24233402242224130421 |
6 | 314015034351311303 |
7 | 14456114306645436 |
oct | 1447557736205067 |
9 | 237468618382203 |
10 | 55506001005111 |
11 | 1675aa6558aaa8 |
12 | 628552751b533 |
13 | 24c8268c933b7 |
14 | d9c70d1a511d |
15 | 663c89c4a076 |
hex | 327b7f790a37 |
55506001005111 has 16 divisors (see below), whose sum is σ = 78340466540160. Its totient is φ = 34897116908640.
The previous prime is 55506001005109. The next prime is 55506001005113. The reversal of 55506001005111 is 11150010060555.
It is an interprime number because it is at equal distance from previous prime (55506001005109) and next prime (55506001005113).
It is not a de Polignac number, because 55506001005111 - 21 = 55506001005109 is a prime.
It is a super-2 number, since 2×555060010051112 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55506001005113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7418601045 + ... + 7418608526.
It is an arithmetic number, because the mean of its divisors is an integer number (4896279158760).
Almost surely, 255506001005111 is an apocalyptic number.
55506001005111 is a deficient number, since it is larger than the sum of its proper divisors (22834465535049).
55506001005111 is a wasteful number, since it uses less digits than its factorization.
55506001005111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14837209646.
The product of its (nonzero) digits is 3750, while the sum is 30.
Adding to 55506001005111 its reverse (11150010060555), we get a palindrome (66656011065666).
The spelling of 55506001005111 in words is "fifty-five trillion, five hundred six billion, one million, five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •