Base | Representation |
---|---|
bin | 1001100010101111… |
… | …10110100001100110 |
3 | 111020001101210012110 |
4 | 10301113312201212 |
5 | 40443031203101 |
6 | 2204214101450 |
7 | 240650234655 |
oct | 46127664146 |
9 | 14201353173 |
10 | 5123303526 |
11 | 2199a75850 |
12 | bab94a886 |
13 | 638571363 |
14 | 3685db19c |
15 | 1eebb0cd6 |
hex | 1315f6866 |
5123303526 has 64 divisors (see below), whose sum is σ = 12016926720. Its totient is φ = 1439494560.
The previous prime is 5123303519. The next prime is 5123303551. The reversal of 5123303526 is 6253033215.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5123303493 and 5123303502.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 15475 + ... + 102401.
It is an arithmetic number, because the mean of its divisors is an integer number (187764480).
Almost surely, 25123303526 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5123303526, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6008463360).
5123303526 is an abundant number, since it is smaller than the sum of its proper divisors (6893623194).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5123303526 is a wasteful number, since it uses less digits than its factorization.
5123303526 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87009.
The product of its (nonzero) digits is 16200, while the sum is 30.
The square root of 5123303526 is about 71577.2556473074. The cubic root of 5123303526 is about 1723.9183614440.
The spelling of 5123303526 in words is "five billion, one hundred twenty-three million, three hundred three thousand, five hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •