Base | Representation |
---|---|
bin | 1010000110010010… |
… | …11100101001111101 |
3 | 111222211112121210010 |
4 | 11003021130221331 |
5 | 42100402024222 |
6 | 2253545533433 |
7 | 251231065200 |
oct | 50311345175 |
9 | 14884477703 |
10 | 5421517437 |
11 | 233233a326 |
12 | 10737a4279 |
13 | 6852951ab |
14 | 396067937 |
15 | 21ae6a80c |
hex | 14325ca7d |
5421517437 has 48 divisors (see below), whose sum is σ = 8963865600. Its totient is φ = 2897687520.
The previous prime is 5421517403. The next prime is 5421517477. The reversal of 5421517437 is 7347151245.
It is not a de Polignac number, because 5421517437 - 211 = 5421515389 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5421517395 and 5421517404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5421517477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 208362 + ... + 232932.
It is an arithmetic number, because the mean of its divisors is an integer number (186747200).
Almost surely, 25421517437 is an apocalyptic number.
5421517437 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
It is an amenable number.
5421517437 is a deficient number, since it is larger than the sum of its proper divisors (3542348163).
5421517437 is a wasteful number, since it uses less digits than its factorization.
5421517437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24686 (or 24679 counting only the distinct ones).
The product of its digits is 117600, while the sum is 39.
The square root of 5421517437 is about 73630.9543398699. The cubic root of 5421517437 is about 1756.7378274763.
The spelling of 5421517437 in words is "five billion, four hundred twenty-one million, five hundred seventeen thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •