Base | Representation |
---|---|
bin | 1010000110111001… |
… | …00000011011000000 |
3 | 112000011221110020012 |
4 | 11003130200123000 |
5 | 42103141413400 |
6 | 2254245004052 |
7 | 251321414234 |
oct | 50334403300 |
9 | 15004843205 |
10 | 5426513600 |
11 | 2335141a92 |
12 | 10753b3628 |
13 | 6863242c1 |
14 | 3969a85c4 |
15 | 21b605d35 |
hex | 1437206c0 |
5426513600 has 84 divisors (see below), whose sum is σ = 13387815744. Its totient is φ = 2164884480.
The previous prime is 5426513569. The next prime is 5426513621. The reversal of 5426513600 is 63156245.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 630929 + ... + 639471.
Almost surely, 25426513600 is an apocalyptic number.
5426513600 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 5426513600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6693907872).
5426513600 is an abundant number, since it is smaller than the sum of its proper divisors (7961302144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5426513600 is a wasteful number, since it uses less digits than its factorization.
5426513600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8962 (or 8947 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 32.
The square root of 5426513600 is about 73664.8735830043. The cubic root of 5426513600 is about 1757.2772984457.
Adding to 5426513600 its reverse (63156245), we get a palindrome (5489669845).
The spelling of 5426513600 in words is "five billion, four hundred twenty-six million, five hundred thirteen thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •