Base | Representation |
---|---|
bin | 10110110000110010101100… |
… | …11111110101111011001100 |
3 | 20120020012201000110120110110 |
4 | 23120121112133311323030 |
5 | 23030100120003234000 |
6 | 254242541035240020 |
7 | 13354232364242136 |
oct | 1330312637657314 |
9 | 216205630416413 |
10 | 50055000055500 |
11 | 14a4922a666910 |
12 | 5744bb22a9010 |
13 | 21c122134090b |
14 | c50964012056 |
15 | 5bc0a346c850 |
hex | 2d86567f5ecc |
50055000055500 has 96 divisors (see below), whose sum is σ = 159011083865088. Its totient is φ = 12134545464000.
The previous prime is 50055000055477. The next prime is 50055000055553. The reversal of 50055000055500 is 555000055005.
It is a super-2 number, since 2×500550000555002 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1516801684 + ... + 1516834683.
It is an arithmetic number, because the mean of its divisors is an integer number (1656365456928).
Almost surely, 250055000055500 is an apocalyptic number.
50055000055500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50055000055500 is an abundant number, since it is smaller than the sum of its proper divisors (108956083809588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50055000055500 is a wasteful number, since it uses less digits than its factorization.
50055000055500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3033636400 (or 3033636388 counting only the distinct ones).
The product of its (nonzero) digits is 15625, while the sum is 30.
The spelling of 50055000055500 in words is "fifty trillion, fifty-five billion, fifty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •