Base | Representation |
---|---|
bin | 100001001111100… |
… | …000101110111100 |
3 | 1102212102211021120 |
4 | 201033200232330 |
5 | 2120233324424 |
6 | 131201430540 |
7 | 16551331254 |
oct | 4117405674 |
9 | 1385384246 |
10 | 557714364 |
11 | 2668a7069 |
12 | 13693b450 |
13 | 8b7118cc |
14 | 540da964 |
15 | 33e68a79 |
hex | 213e0bbc |
557714364 has 12 divisors (see below), whose sum is σ = 1301333544. Its totient is φ = 185904784.
The previous prime is 557714363. The next prime is 557714411. The reversal of 557714364 is 463417755.
It is a happy number.
557714364 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×5577143642 = 622090623623848992, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (557714363) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23238087 + ... + 23238110.
It is an arithmetic number, because the mean of its divisors is an integer number (108444462).
Almost surely, 2557714364 is an apocalyptic number.
It is an amenable number.
557714364 is an abundant number, since it is smaller than the sum of its proper divisors (743619180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
557714364 is a wasteful number, since it uses less digits than its factorization.
557714364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46476204 (or 46476202 counting only the distinct ones).
The product of its digits is 352800, while the sum is 42.
The square root of 557714364 is about 23615.9768800700. The cubic root of 557714364 is about 823.1341310636.
The spelling of 557714364 in words is "five hundred fifty-seven million, seven hundred fourteen thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •