Base | Representation |
---|---|
bin | 100001010000111… |
… | …000001001101111 |
3 | 1102220010000110022 |
4 | 201100320021233 |
5 | 2120331304211 |
6 | 131213232355 |
7 | 16554352220 |
oct | 4120701157 |
9 | 1386100408 |
10 | 558072431 |
11 | 267021094 |
12 | 136a926bb |
13 | 8b808897 |
14 | 54191247 |
15 | 33ed9bdb |
hex | 2143826f |
558072431 has 8 divisors (see below), whose sum is σ = 641103264. Its totient is φ = 475868160.
The previous prime is 558072419. The next prime is 558072439. The reversal of 558072431 is 134270855.
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 558072431 - 26 = 558072367 is a prime.
It is a super-2 number, since 2×5580724312 = 622889676484499522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 558072391 and 558072400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (558072439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 205190 + ... + 207891.
It is an arithmetic number, because the mean of its divisors is an integer number (80137908).
Almost surely, 2558072431 is an apocalyptic number.
558072431 is a deficient number, since it is larger than the sum of its proper divisors (83030833).
558072431 is a wasteful number, since it uses less digits than its factorization.
558072431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413281.
The product of its (nonzero) digits is 33600, while the sum is 35.
The square root of 558072431 is about 23623.5566966534. The cubic root of 558072431 is about 823.3102511555.
The spelling of 558072431 in words is "five hundred fifty-eight million, seventy-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.202 sec. • engine limits •