Base | Representation |
---|---|
bin | 1100000101111011100… |
… | …10100100010111111111 |
3 | 1110201110222110021210021 |
4 | 12002331302210113333 |
5 | 23301421224313211 |
6 | 514513432353011 |
7 | 42006334213153 |
oct | 6027562442777 |
9 | 1421428407707 |
10 | 415501010431 |
11 | 150238540a21 |
12 | 6863a545767 |
13 | 30248c04370 |
14 | 16178b63063 |
15 | ac1c6c5771 |
hex | 60bdca45ff |
415501010431 has 32 divisors (see below), whose sum is σ = 468127296000. Its totient is φ = 366179235840.
The previous prime is 415501010423. The next prime is 415501010459. The reversal of 415501010431 is 134010105514.
It is a cyclic number.
It is not a de Polignac number, because 415501010431 - 23 = 415501010423 is a prime.
It is a super-2 number, since 2×4155010104312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 415501010396 and 415501010405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (415501017431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16378545 + ... + 16403893.
It is an arithmetic number, because the mean of its divisors is an integer number (14628978000).
Almost surely, 2415501010431 is an apocalyptic number.
415501010431 is a deficient number, since it is larger than the sum of its proper divisors (52626285569).
415501010431 is a wasteful number, since it uses less digits than its factorization.
415501010431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25939.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 415501010431 its reverse (134010105514), we get a palindrome (549511115945).
The spelling of 415501010431 in words is "four hundred fifteen billion, five hundred one million, ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •