Base | Representation |
---|---|
bin | 100001001110101… |
… | …101100010000001 |
3 | 1102212001011121001 |
4 | 201032231202001 |
5 | 2120210122031 |
6 | 131153132001 |
7 | 16546465651 |
oct | 4116554201 |
9 | 1385034531 |
10 | 557504641 |
11 | 266773541 |
12 | 13685a001 |
13 | 8b66a305 |
14 | 54084361 |
15 | 33e26861 |
hex | 213ad881 |
557504641 has 8 divisors (see below), whose sum is σ = 573027840. Its totient is φ = 542005488.
The previous prime is 557504639. The next prime is 557504653. The reversal of 557504641 is 146405755.
It is a happy number.
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 557504641 - 21 = 557504639 is a prime.
It is a super-2 number, since 2×5575046412 = 621622849473077762, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
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 557504641.
It is not an unprimeable number, because it can be changed into a prime (557504611) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47520 + ... + 58078.
It is an arithmetic number, because the mean of its divisors is an integer number (71628480).
Almost surely, 2557504641 is an apocalyptic number.
It is an amenable number.
557504641 is a deficient number, since it is larger than the sum of its proper divisors (15523199).
557504641 is a wasteful number, since it uses less digits than its factorization.
557504641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12023.
The product of its (nonzero) digits is 84000, while the sum is 37.
The square root of 557504641 is about 23611.5361846704. The cubic root of 557504641 is about 823.0309409638.
The spelling of 557504641 in words is "five hundred fifty-seven million, five hundred four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •