Base | Representation |
---|---|
bin | 11001000010001010100111… |
… | …10110111110111110110001 |
3 | 21012220201200100021120000122 |
4 | 30201011103312332332301 |
5 | 24203414401201134010 |
6 | 313025342214300025 |
7 | 14411142246533462 |
oct | 1441052366767661 |
9 | 235821610246018 |
10 | 55050002755505 |
11 | 165a463644a97a |
12 | 6211086657615 |
13 | 2494267cb0224 |
14 | d84611bdad69 |
15 | 656e9c0bc855 |
hex | 321153dbefb1 |
55050002755505 has 16 divisors (see below), whose sum is σ = 66126398581584. Its totient is φ = 43995741849600.
The previous prime is 55050002755481. The next prime is 55050002755529. The reversal of 55050002755505 is 50555720005055.
It is an interprime number because it is at equal distance from previous prime (55050002755481) and next prime (55050002755529).
It can be written as a sum of positive squares in 8 ways, for example, as 739249161616 + 54310753593889 = 859796^2 + 7369583^2 .
It is not a de Polignac number, because 55050002755505 - 224 = 55049985978289 is a prime.
It is a super-2 number, since 2×550500027555052 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 150640667 + ... + 151005663.
It is an arithmetic number, because the mean of its divisors is an integer number (4132899911349).
Almost surely, 255050002755505 is an apocalyptic number.
It is an amenable number.
55050002755505 is a deficient number, since it is larger than the sum of its proper divisors (11076395826079).
55050002755505 is a wasteful number, since it uses less digits than its factorization.
55050002755505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 395236.
The product of its (nonzero) digits is 1093750, while the sum is 44.
The spelling of 55050002755505 in words is "fifty-five trillion, fifty billion, two million, seven hundred fifty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •