Base | Representation |
---|---|
bin | 1001010100000110… |
… | …11010100011010000 |
3 | 110220111100000001100 |
4 | 10222003122203100 |
5 | 40220112134202 |
6 | 2144110104400 |
7 | 234626411250 |
oct | 45203324320 |
9 | 13814300040 |
10 | 5000505552 |
11 | 2136722919 |
12 | b767ab100 |
13 | 618ca7a33 |
14 | 356193960 |
15 | 1e400641c |
hex | 12a0da8d0 |
5000505552 has 120 divisors (see below), whose sum is σ = 16016960960. Its totient is φ = 1426636800.
The previous prime is 5000505479. The next prime is 5000505553. The reversal of 5000505552 is 2555050005.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5000505553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 771927 + ... + 778377.
Almost surely, 25000505552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5000505552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8008480480).
5000505552 is an abundant number, since it is smaller than the sum of its proper divisors (11016455408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5000505552 is a wasteful number, since it uses less digits than its factorization.
5000505552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7241 (or 7232 counting only the distinct ones).
The product of its (nonzero) digits is 6250, while the sum is 27.
The square root of 5000505552 is about 70714.2528207716. The cubic root of 5000505552 is about 1710.0335768517.
Adding to 5000505552 its reverse (2555050005), we get a palindrome (7555555557).
The spelling of 5000505552 in words is "five billion, five hundred five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •