Base | Representation |
---|---|
bin | 1001010100000100… |
… | …1011101000111000 |
3 | 20110020102000000212 |
4 | 2111001023220320 |
5 | 20110012140000 |
6 | 1052030050252 |
7 | 115645425005 |
oct | 22501135070 |
9 | 6406360025 |
10 | 2500115000 |
11 | 1073282449 |
12 | 599349988 |
13 | 30ac6c8b6 |
14 | 19a0808ac |
15 | e974ec35 |
hex | 9504ba38 |
2500115000 has 80 divisors (see below), whose sum is σ = 6166307400. Its totient is φ = 947376000.
The previous prime is 2500114999. The next prime is 2500115011. The reversal of 2500115000 is 5110052.
It is a congruent number.
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 81842 + ... + 108158.
Almost surely, 22500115000 is an apocalyptic number.
2500115000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2500115000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3083153700).
2500115000 is an abundant number, since it is smaller than the sum of its proper divisors (3666192400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2500115000 is a wasteful number, since it uses less digits than its factorization.
2500115000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26362 (or 26343 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 14.
The square root of 2500115000 is about 50001.1499867753. The cubic root of 2500115000 is about 1357.2296185134.
Adding to 2500115000 its reverse (5110052), we get a palindrome (2505225052).
The spelling of 2500115000 in words is "two billion, five hundred million, one hundred fifteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •