Base | Representation |
---|---|
bin | 1010000101100010… |
… | …00011110110111011 |
3 | 111222101111211012101 |
4 | 11002301003312323 |
5 | 42042232440121 |
6 | 2253200524231 |
7 | 251122540504 |
oct | 50261036673 |
9 | 14871454171 |
10 | 5415124411 |
11 | 2329773134 |
12 | 1071620677 |
13 | 683b67338 |
14 | 395281bab |
15 | 21a606491 |
hex | 142c43dbb |
5415124411 has 8 divisors (see below), whose sum is σ = 5551871040. Its totient is φ = 5279275008.
The previous prime is 5415124399. The next prime is 5415124447. The reversal of 5415124411 is 1144215145.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5415124411 - 213 = 5415116219 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5415124411.
It is not an unprimeable number, because it can be changed into a prime (5415124111) 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 7 ways as a sum of consecutive naturals, for example, 212076 + ... + 236233.
It is an arithmetic number, because the mean of its divisors is an integer number (693983880).
Almost surely, 25415124411 is an apocalyptic number.
5415124411 is a deficient number, since it is larger than the sum of its proper divisors (136746629).
5415124411 is a wasteful number, since it uses less digits than its factorization.
5415124411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448613.
The product of its digits is 3200, while the sum is 28.
The square root of 5415124411 is about 73587.5289094558. The cubic root of 5415124411 is about 1756.0470437555.
Adding to 5415124411 its reverse (1144215145), we get a palindrome (6559339556).
The spelling of 5415124411 in words is "five billion, four hundred fifteen million, one hundred twenty-four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •