Base | Representation |
---|---|
bin | 110011001110100011… |
… | …100111010010010000 |
3 | 12020222101201001111002 |
4 | 303032203213102100 |
5 | 1400122243100000 |
6 | 41134033041132 |
7 | 3655035132155 |
oct | 631643472220 |
9 | 166871631432 |
10 | 55005050000 |
11 | 21366a0a20a |
12 | a7b10b61a8 |
13 | 5257979084 |
14 | 293b34822c |
15 | 166de978d5 |
hex | cce8e7490 |
55005050000 has 60 divisors (see below), whose sum is σ = 133206950772. Its totient is φ = 22002000000.
The previous prime is 55005049963. The next prime is 55005050003. The reversal of 55005050000 is 5050055.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 45316191376 + 9688858624 = 212876^2 + 98432^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (55005050003) by changing a digit.
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, 500051 + ... + 600050.
Almost surely, 255005050000 is an apocalyptic number.
55005050000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
55005050000 is an abundant number, since it is smaller than the sum of its proper divisors (78201900772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55005050000 is an equidigital number, since it uses as much as digits as its factorization.
55005050000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100134 (or 1100108 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 20.
Subtracting from 55005050000 its reverse (5050055), we obtain a palindrome (54999999945).
The spelling of 55005050000 in words is "fifty-five billion, five million, fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •