Base | Representation |
---|---|
bin | 1001101110111000… |
… | …00001010100110110 |
3 | 111111010212112100100 |
4 | 10313130001110312 |
5 | 41200103402023 |
6 | 2222251054530 |
7 | 243324163011 |
oct | 46734012466 |
9 | 14433775310 |
10 | 5225059638 |
11 | 2241456707 |
12 | 1019a41446 |
13 | 65367b286 |
14 | 377d28378 |
15 | 208ab0c43 |
hex | 137701536 |
5225059638 has 48 divisors (see below), whose sum is σ = 11839127040. Its totient is φ = 1662301872.
The previous prime is 5225059621. The next prime is 5225059657. The reversal of 5225059638 is 8369505225.
5225059638 is a `hidden beast` number, since 5 + 2 + 2 + 5 + 0 + 5 + 9 + 638 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 5225059593 and 5225059602.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 178053 + ... + 205311.
It is an arithmetic number, because the mean of its divisors is an integer number (246648480).
Almost surely, 25225059638 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5225059638, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5919563520).
5225059638 is an abundant number, since it is smaller than the sum of its proper divisors (6614067402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5225059638 is a wasteful number, since it uses less digits than its factorization.
5225059638 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27753 (or 27750 counting only the distinct ones).
The product of its (nonzero) digits is 648000, while the sum is 45.
The square root of 5225059638 is about 72284.5739974996. The cubic root of 5225059638 is about 1735.2567825527.
The spelling of 5225059638 in words is "five billion, two hundred twenty-five million, fifty-nine thousand, six hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •