Base | Representation |
---|---|
bin | 111111010110000… |
… | …1000110011111000 |
3 | 12111010111120100220 |
4 | 1332230020303320 |
5 | 13323111442030 |
6 | 550524500040 |
7 | 103446306645 |
oct | 17654106370 |
9 | 5433446326 |
10 | 2125499640 |
11 | 9a0875380 |
12 | 4b39aa620 |
13 | 27b4785c4 |
14 | 162406dcc |
15 | c6902a10 |
hex | 7eb08cf8 |
2125499640 has 64 divisors (see below), whose sum is σ = 6956184960. Its totient is φ = 515272320.
The previous prime is 2125499633. The next prime is 2125499641. The reversal of 2125499640 is 469945212.
It is a junction number, because it is equal to n+sod(n) for n = 2125499592 and 2125499601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2125499641) 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, 803794 + ... + 806433.
It is an arithmetic number, because the mean of its divisors is an integer number (108690390).
Almost surely, 22125499640 is an apocalyptic number.
2125499640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2125499640 is an abundant number, since it is smaller than the sum of its proper divisors (4830685320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2125499640 is a wasteful number, since it uses less digits than its factorization.
2125499640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1610252 (or 1610248 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 42.
The square root of 2125499640 is about 46103.1413246429. The cubic root of 2125499640 is about 1285.7415494042.
The spelling of 2125499640 in words is "two billion, one hundred twenty-five million, four hundred ninety-nine thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •