Base | Representation |
---|---|
bin | 1001010111000101… |
… | …00011011001111100 |
3 | 110222020021002020010 |
4 | 10223202203121330 |
5 | 40243003224000 |
6 | 2150400423220 |
7 | 235351403415 |
oct | 45342433174 |
9 | 13866232203 |
10 | 5025445500 |
11 | 2149807649 |
12 | b83017b10 |
13 | 6211ca7ba |
14 | 35960680c |
15 | 1e62d0d50 |
hex | 12b8a367c |
5025445500 has 48 divisors (see below), whose sum is σ = 14634101664. Its totient is φ = 1340118400.
The previous prime is 5025445493. The next prime is 5025445501. The reversal of 5025445500 is 55445205.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5025445501) 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 15 ways as a sum of consecutive naturals, for example, 1673649 + ... + 1676648.
It is an arithmetic number, because the mean of its divisors is an integer number (304877118).
Almost surely, 25025445500 is an apocalyptic number.
5025445500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5025445500 is an abundant number, since it is smaller than the sum of its proper divisors (9608656164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5025445500 is a wasteful number, since it uses less digits than its factorization.
5025445500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3350319 (or 3350307 counting only the distinct ones).
The product of its (nonzero) digits is 20000, while the sum is 30.
The square root of 5025445500 is about 70890.3766388640. The cubic root of 5025445500 is about 1712.8717860095.
The spelling of 5025445500 in words is "five billion, twenty-five million, four hundred forty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •