Base | Representation |
---|---|
bin | 11001010000110111010110… |
… | …00001010101000001111001 |
3 | 21021201000021221202212210011 |
4 | 30220123223001111001321 |
5 | 24240203220300004010 |
6 | 314053345421421521 |
7 | 14462501633352136 |
oct | 1450335301250171 |
9 | 237630257685704 |
10 | 55555050000505 |
11 | 16779845454230 |
12 | 6292b35a0a8a1 |
13 | 24cca849bbcb3 |
14 | da0c4349d58d |
15 | 6651aad8aa8a |
hex | 3286eb055079 |
55555050000505 has 16 divisors (see below), whose sum is σ = 73446676371648. Its totient is φ = 40003636360000.
The previous prime is 55555050000493. The next prime is 55555050000517. The reversal of 55555050000505 is 50500005055555.
It is an interprime number because it is at equal distance from previous prime (55555050000493) and next prime (55555050000517).
It is not a de Polignac number, because 55555050000505 - 25 = 55555050000473 is a prime.
It is a super-2 number, since 2×555550500005052 (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, 5000448991 + ... + 5000460100.
It is an arithmetic number, because the mean of its divisors is an integer number (4590417273228).
Almost surely, 255555050000505 is an apocalyptic number.
55555050000505 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
55555050000505 is a deficient number, since it is larger than the sum of its proper divisors (17891626371143).
55555050000505 is a wasteful number, since it uses less digits than its factorization.
55555050000505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10000909208.
The product of its (nonzero) digits is 390625, while the sum is 40.
The spelling of 55555050000505 in words is "fifty-five trillion, five hundred fifty-five billion, fifty million, five hundred five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •