Base | Representation |
---|---|
bin | 1100000101100110011… |
… | …11010110000001000101 |
3 | 1110201000122101110012010 |
4 | 12002303033112001011 |
5 | 23301040421120141 |
6 | 514444110444433 |
7 | 42002054534514 |
oct | 6026317260105 |
9 | 1421018343163 |
10 | 415324004421 |
11 | 150157633767 |
12 | 685ab203719 |
13 | 3021b33b191 |
14 | 1615d44867b |
15 | ac0bdae416 |
hex | 60b33d6045 |
415324004421 has 8 divisors (see below), whose sum is σ = 553769536320. Its totient is φ = 276880571072.
The previous prime is 415324004387. The next prime is 415324004429. The reversal of 415324004421 is 124400423514.
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 415324004421 - 215 = 415323971653 is a prime.
It is a super-3 number, since 3×4153240044213 (a number of 36 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (415324004429) 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, 17056 + ... + 911558.
It is an arithmetic number, because the mean of its divisors is an integer number (69221192040).
Almost surely, 2415324004421 is an apocalyptic number.
It is an amenable number.
415324004421 is a deficient number, since it is larger than the sum of its proper divisors (138445531899).
415324004421 is a wasteful number, since it uses less digits than its factorization.
415324004421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049275.
The product of its (nonzero) digits is 15360, while the sum is 30.
Adding to 415324004421 its reverse (124400423514), we get a palindrome (539724427935).
The spelling of 415324004421 in words is "four hundred fifteen billion, three hundred twenty-four million, four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •