Base | Representation |
---|---|
bin | 1001010111010000… |
… | …1101000011001110 |
3 | 20111011120112020220 |
4 | 2111310031003032 |
5 | 20121423141001 |
6 | 1053224452210 |
7 | 116200212360 |
oct | 22564150316 |
9 | 6434515226 |
10 | 2513490126 |
11 | 107a888374 |
12 | 5a191a066 |
13 | 310973784 |
14 | 19bb62d30 |
15 | ea9e2c36 |
hex | 95d0d0ce |
2513490126 has 128 divisors (see below), whose sum is σ = 6260613120. Its totient is φ = 656802432.
The previous prime is 2513490121. The next prime is 2513490127. The reversal of 2513490126 is 6210943152.
It is a super-2 number, since 2×25134901262 = 12635265226998991752, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2513490121) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2833255 + ... + 2834141.
It is an arithmetic number, because the mean of its divisors is an integer number (48911040).
Almost surely, 22513490126 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2513490126, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3130306560).
2513490126 is an abundant number, since it is smaller than the sum of its proper divisors (3747122994).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2513490126 is a wasteful number, since it uses less digits than its factorization.
2513490126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1038.
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 2513490126 is about 50134.7197658469. The cubic root of 2513490126 is about 1359.6456195314.
The spelling of 2513490126 in words is "two billion, five hundred thirteen million, four hundred ninety thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •