Base | Representation |
---|---|
bin | 10110110000110011101111… |
… | …00100110010011011110111 |
3 | 20120020021010200200200021111 |
4 | 23120121313210302123313 |
5 | 23030102234040000210 |
6 | 254243112101455451 |
7 | 13354252213216243 |
oct | 1330316744623367 |
9 | 216207120620244 |
10 | 50055555000055 |
11 | 14a49494940980 |
12 | 5745128111587 |
13 | 21c12ac2c2887 |
14 | c509b79cb423 |
15 | 5bc0d703a88a |
hex | 2d86779326f7 |
50055555000055 has 16 divisors (see below), whose sum is σ = 65558490480000. Its totient is φ = 36386696400160.
The previous prime is 50055555000053. The next prime is 50055555000067. The reversal of 50055555000055 is 55000055555005.
It is not a de Polignac number, because 50055555000055 - 21 = 50055555000053 is a prime.
It is a super-2 number, since 2×500555550000552 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50055554999981 and 50055555000017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50055555000053) 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, 216678505 + ... + 216909394.
It is an arithmetic number, because the mean of its divisors is an integer number (4097405655000).
Almost surely, 250055555000055 is an apocalyptic number.
50055555000055 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
50055555000055 is a deficient number, since it is larger than the sum of its proper divisors (15502935479945).
50055555000055 is a wasteful number, since it uses less digits than its factorization.
50055555000055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433590014.
The product of its (nonzero) digits is 390625, while the sum is 40.
The spelling of 50055555000055 in words is "fifty trillion, fifty-five billion, five hundred fifty-five million, fifty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •