Base | Representation |
---|---|
bin | 10110101111010101100100… |
… | …10000110010011101111100 |
3 | 20120001102122102112212020202 |
4 | 23113222302100302131330 |
5 | 23023240220000134000 |
6 | 254203551352503032 |
7 | 13350512341650461 |
oct | 1327526220623574 |
9 | 216042572485222 |
10 | 50005000005500 |
11 | 14a2a00196a241 |
12 | 57373793aaa78 |
13 | 21b95b3584207 |
14 | c4c37d6ab668 |
15 | 5bab28ab7dd5 |
hex | 2d7ab243277c |
50005000005500 has 96 divisors (see below), whose sum is σ = 109294100435520. Its totient is φ = 19986771974400.
The previous prime is 50005000005487. The next prime is 50005000005509. The reversal of 50005000005500 is 550000050005.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50005000005509) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5597779034 + ... + 5597787966.
It is an arithmetic number, because the mean of its divisors is an integer number (1138480212870).
Almost surely, 250005000005500 is an apocalyptic number.
50005000005500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50005000005500 is an abundant number, since it is smaller than the sum of its proper divisors (59289100430020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50005000005500 is a wasteful number, since it uses less digits than its factorization.
50005000005500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16224 (or 16212 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 20.
Adding to 50005000005500 its reverse (550000050005), we get a palindrome (50555000055505).
The spelling of 50005000005500 in words is "fifty trillion, five billion, five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •