Base | Representation |
---|---|
bin | 11001000000101110100001… |
… | …00100101011001111011001 |
3 | 21012202000001021112201222211 |
4 | 30200113100210223033121 |
5 | 24202112114202004010 |
6 | 312550523440115121 |
7 | 14404442016024256 |
oct | 1440272044531731 |
9 | 235660037481884 |
10 | 55000555500505 |
11 | 1658567179a37a |
12 | 6203586905aa1 |
13 | 248c6b7902264 |
14 | d82080a7242d |
15 | 655a5600e08a |
hex | 3205d092b3d9 |
55000555500505 has 8 divisors (see below), whose sum is σ = 66003014795400. Its totient is φ = 43998878937216.
The previous prime is 55000555500493. The next prime is 55000555500509. The reversal of 55000555500505 is 50500555500055.
It can be written as a sum of positive squares in 4 ways, for example, as 6045289286089 + 48955266214416 = 2458717^2 + 6996804^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-55000555500505 is a prime.
It is a super-2 number, since 2×550005555005052 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (55000555500509) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 195528300 + ... + 195809389.
It is an arithmetic number, because the mean of its divisors is an integer number (8250376849425).
Almost surely, 255000555500505 is an apocalyptic number.
It is an amenable number.
55000555500505 is a deficient number, since it is larger than the sum of its proper divisors (11002459294895).
55000555500505 is a wasteful number, since it uses less digits than its factorization.
55000555500505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391365803.
The product of its (nonzero) digits is 390625, while the sum is 40.
The spelling of 55000555500505 in words is "fifty-five trillion, five hundred fifty-five million, five hundred thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •