Base | Representation |
---|---|
bin | 1001011011001111… |
… | …10000011010110000 |
3 | 111001122222010100010 |
4 | 10231213300122300 |
5 | 40330423121302 |
6 | 2154045054520 |
7 | 236254245450 |
oct | 45547603260 |
9 | 14048863303 |
10 | 5060363952 |
11 | 2167497376 |
12 | b92857440 |
13 | 6285053c7 |
14 | 3600d5d60 |
15 | 1e93cc16c |
hex | 12d9f06b0 |
5060363952 has 160 divisors (see below), whose sum is σ = 15637570560. Its totient is φ = 1378713600.
The previous prime is 5060363933. The next prime is 5060363953. The reversal of 5060363952 is 2593630605.
It is a self number, because there is not a number n which added to its sum of digits gives 5060363952.
It is not an unprimeable number, because it can be changed into a prime (5060363953) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3159952 + ... + 3161552.
It is an arithmetic number, because the mean of its divisors is an integer number (97734816).
Almost surely, 25060363952 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5060363952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7818785280).
5060363952 is an abundant number, since it is smaller than the sum of its proper divisors (10577206608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5060363952 is a wasteful number, since it uses less digits than its factorization.
5060363952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2051 (or 2045 counting only the distinct ones).
The product of its (nonzero) digits is 145800, while the sum is 39.
The square root of 5060363952 is about 71136.2351548070. The cubic root of 5060363952 is about 1716.8298321214.
The spelling of 5060363952 in words is "five billion, sixty million, three hundred sixty-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.281 sec. • engine limits •