Base | Representation |
---|---|
bin | 100100011010111001000… |
… | …0010000101101011010000 |
3 | 122201112012101111212201121 |
4 | 1020311302002011223100 |
5 | 1124002331303100000 |
6 | 14351303513212024 |
7 | 1024432124260003 |
oct | 110656202055320 |
9 | 18645171455647 |
10 | 5005550050000 |
11 | 165a929566245 |
12 | 68a138701014 |
13 | 2a4037b80016 |
14 | 1343ac90b53a |
15 | 8a314acab1a |
hex | 48d72085ad0 |
5005550050000 has 60 divisors (see below), whose sum is σ = 12122040788172. Its totient is φ = 2002220000000.
The previous prime is 5005550049947. The next prime is 5005550050037. The reversal of 5005550050000 is 500555005.
It can be written as a sum of positive squares in 6 ways, for example, as 4548460474944 + 457089575056 = 2132712^2 + 676084^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 50005501 + ... + 50105500.
Almost surely, 25005550050000 is an apocalyptic number.
5005550050000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5005550050000 is an abundant number, since it is smaller than the sum of its proper divisors (7116490738172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5005550050000 is an equidigital number, since it uses as much as digits as its factorization.
5005550050000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100111034 (or 100111008 counting only the distinct ones).
The product of its (nonzero) digits is 3125, while the sum is 25.
5005550050000 divided by its reverse (500555005) gives a 4-th power (10000 = 104).
The spelling of 5005550050000 in words is "five trillion, five billion, five hundred fifty million, fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •