Base | Representation |
---|---|
bin | 1001011001011110… |
… | …11101000011111000 |
3 | 111000122012021022110 |
4 | 10230233131003320 |
5 | 40313133321400 |
6 | 2152400452320 |
7 | 236014634331 |
oct | 45457350370 |
9 | 14018167273 |
10 | 5045604600 |
11 | 215a126463 |
12 | b8991a0a0 |
13 | 62543846a |
14 | 35c173288 |
15 | 1e7e63e50 |
hex | 12cbdd0f8 |
5045604600 has 96 divisors (see below), whose sum is σ = 15745242240. Its totient is φ = 1336560000.
The previous prime is 5045604593. The next prime is 5045604617. The reversal of 5045604600 is 64065405.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 62755 + ... + 118445.
It is an arithmetic number, because the mean of its divisors is an integer number (164012940).
Almost surely, 25045604600 is an apocalyptic number.
5045604600 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5045604600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7872621120).
5045604600 is an abundant number, since it is smaller than the sum of its proper divisors (10699637640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5045604600 is a wasteful number, since it uses less digits than its factorization.
5045604600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55861 (or 55852 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
The square root of 5045604600 is about 71032.4193590504. The cubic root of 5045604600 is about 1715.1590714536.
The spelling of 5045604600 in words is "five billion, forty-five million, six hundred four thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •