Base | Representation |
---|---|
bin | 10110101111001100010001… |
… | …00010100100010000111110 |
3 | 20120000221202022200010001110 |
4 | 23113212020202210100332 |
5 | 23023200002243234200 |
6 | 254201404001422450 |
7 | 13350244510405254 |
oct | 1327461042442076 |
9 | 216027668603043 |
10 | 50000005055550 |
11 | 14a279793a1430 |
12 | 573640463aa26 |
13 | 21b8c987a3124 |
14 | c4c0281625d4 |
15 | 5ba93530cb50 |
hex | 2d79888a443e |
50000005055550 has 96 divisors (see below), whose sum is σ = 142392358984320. Its totient is φ = 11483254742400.
The previous prime is 50000005055513. The next prime is 50000005055573. The reversal of 50000005055550 is 5555050000005.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 797416897 + ... + 797479596.
It is an arithmetic number, because the mean of its divisors is an integer number (1483253739420).
Almost surely, 250000005055550 is an apocalyptic number.
50000005055550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50000005055550 is an abundant number, since it is smaller than the sum of its proper divisors (92392353928770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50000005055550 is a wasteful number, since it uses less digits than its factorization.
50000005055550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1594896538 (or 1594896533 counting only the distinct ones).
The product of its (nonzero) digits is 15625, while the sum is 30.
Adding to 50000005055550 its reverse (5555050000005), we get a palindrome (55555055055555).
The spelling of 50000005055550 in words is "fifty trillion, five million, fifty-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •