Base | Representation |
---|---|
bin | 1001100111111010… |
… | …01110010001000000 |
3 | 111100001222020121010 |
4 | 10303331032101000 |
5 | 41040130421103 |
6 | 2212403200520 |
7 | 242014560510 |
oct | 46375162100 |
9 | 14301866533 |
10 | 5166654528 |
11 | 2211495022 |
12 | 1002376140 |
13 | 64453c239 |
14 | 370283840 |
15 | 2038c5903 |
hex | 133f4e440 |
5166654528 has 112 divisors (see below), whose sum is σ = 15639312384. Its totient is φ = 1474644480.
The previous prime is 5166654527. The next prime is 5166654533. The reversal of 5166654528 is 8254566615.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (5166654523) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2110201 + ... + 2112647.
Almost surely, 25166654528 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 5166654528, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7819656192).
5166654528 is an abundant number, since it is smaller than the sum of its proper divisors (10472657856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5166654528 is a wasteful number, since it uses less digits than its factorization.
5166654528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4040 (or 4030 counting only the distinct ones).
The product of its digits is 1728000, while the sum is 48.
The square root of 5166654528 is about 71879.4444051983. Note that the first 4 decimals coincide. The cubic root of 5166654528 is about 1728.7670420119.
The spelling of 5166654528 in words is "five billion, one hundred sixty-six million, six hundred fifty-four thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •