Base | Representation |
---|---|
bin | 11101111000101… |
… | …111101000010101 |
3 | 1021221111111021111 |
4 | 131320233220111 |
5 | 2011330230141 |
6 | 121431015021 |
7 | 15265644424 |
oct | 3570575025 |
9 | 1257444244 |
10 | 501414421 |
11 | 238043092 |
12 | 11bb0a471 |
13 | 7cb5bb31 |
14 | 4a8432bb |
15 | 2e047381 |
hex | 1de2fa15 |
501414421 has 8 divisors (see below), whose sum is σ = 527212224. Its totient is φ = 475949760.
The previous prime is 501414413. The next prime is 501414451. The reversal of 501414421 is 124414105.
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 501414421 - 23 = 501414413 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 501414392 and 501414401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (501414451) 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, 80196 + ... + 86221.
It is an arithmetic number, because the mean of its divisors is an integer number (65901528).
Almost surely, 2501414421 is an apocalyptic number.
It is an amenable number.
501414421 is a deficient number, since it is larger than the sum of its proper divisors (25797803).
501414421 is a wasteful number, since it uses less digits than its factorization.
501414421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166571.
The product of its (nonzero) digits is 640, while the sum is 22.
The square root of 501414421 is about 22392.2848543868. The cubic root of 501414421 is about 794.4482391670.
Adding to 501414421 its reverse (124414105), we get a palindrome (625828526).
The spelling of 501414421 in words is "five hundred one million, four hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •