Base | Representation |
---|---|
bin | 1001100111001000… |
… | …10001001110010110 |
3 | 111022121122220101000 |
4 | 10303210101032112 |
5 | 41031442104141 |
6 | 2212011044130 |
7 | 241605144234 |
oct | 46344211626 |
9 | 14277586330 |
10 | 5160113046 |
11 | 2208827340 |
12 | 1000140646 |
13 | 64308b93a |
14 | 36d45d954 |
15 | 2030325b6 |
hex | 133911396 |
5160113046 has 64 divisors (see below), whose sum is σ = 12542918400. Its totient is φ = 1559476800.
The previous prime is 5160112963. The next prime is 5160113053. The reversal of 5160113046 is 6403110615.
5160113046 is a `hidden beast` number, since 5 + 1 + 601 + 13 + 0 + 46 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 213666 + ... + 236586.
It is an arithmetic number, because the mean of its divisors is an integer number (195983100).
Almost surely, 25160113046 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5160113046, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6271459200).
5160113046 is an abundant number, since it is smaller than the sum of its proper divisors (7382805354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5160113046 is a wasteful number, since it uses less digits than its factorization.
5160113046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23322 (or 23316 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 5160113046 is about 71833.9268451892. The cubic root of 5160113046 is about 1728.0371387176.
The spelling of 5160113046 in words is "five billion, one hundred sixty million, one hundred thirteen thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.048 sec. • engine limits •