Base | Representation |
---|---|
bin | 1001100010010110… |
… | …01000000000000000 |
3 | 111012211010021200000 |
4 | 10301023020000000 |
5 | 40441202422412 |
6 | 2204014400000 |
7 | 240610001112 |
oct | 46113100000 |
9 | 14184107600 |
10 | 5119967232 |
11 | 21980a7186 |
12 | baa800000 |
13 | 637973913 |
14 | 367dad3b2 |
15 | 1ee7524dc |
hex | 1312c8000 |
5119967232 has 192 divisors, whose sum is σ = 15362452560. Its totient is φ = 1704001536.
The previous prime is 5119967213. The next prime is 5119967239. The reversal of 5119967232 is 2327699115.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (192).
Its product of digits (204120) is a multiple of the sum of its prime divisors (648).
It is a nialpdrome in base 12.
It is not an unprimeable number, because it can be changed into a prime (5119967239) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7962303 + ... + 7962945.
Almost surely, 25119967232 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 5119967232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7681226280).
5119967232 is an abundant number, since it is smaller than the sum of its proper divisors (10242485328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5119967232 is an frugal number, since it uses more digits than its factorization.
5119967232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 688 (or 648 counting only the distinct ones).
The product of its digits is 204120, while the sum is 45.
The square root of 5119967232 is about 71553.9463062660. The cubic root of 5119967232 is about 1723.5440751158.
The spelling of 5119967232 in words is "five billion, one hundred nineteen million, nine hundred sixty-seven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •