Base | Representation |
---|---|
bin | 100000111110101… |
… | …011100000011011 |
3 | 1102120010122201021 |
4 | 200332223200123 |
5 | 2113121131133 |
6 | 130523103311 |
7 | 16465663330 |
oct | 4076534033 |
9 | 1376118637 |
10 | 553302043 |
11 | 264363018 |
12 | 135371b37 |
13 | 8a828478 |
14 | 536ac987 |
15 | 3389652d |
hex | 20fab81b |
553302043 has 32 divisors (see below), whose sum is σ = 697171968. Its totient is φ = 428198400.
The previous prime is 553302041. The next prime is 553302047. The reversal of 553302043 is 340203355.
It is a happy number.
553302043 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 553302043 - 21 = 553302041 is a prime.
It is a super-2 number, since 2×5533020432 = 612286301575947698, 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 = 553301999 and 553302017.
It is not an unprimeable number, because it can be changed into a prime (553302041) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 467913 + ... + 469093.
It is an arithmetic number, because the mean of its divisors is an integer number (21786624).
Almost surely, 2553302043 is an apocalyptic number.
553302043 is a deficient number, since it is larger than the sum of its proper divisors (143869925).
553302043 is a wasteful number, since it uses less digits than its factorization.
553302043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1363.
The product of its (nonzero) digits is 5400, while the sum is 25.
The square root of 553302043 is about 23522.3732433613. The cubic root of 553302043 is about 820.9576571673.
Adding to 553302043 its reverse (340203355), we get a palindrome (893505398).
The spelling of 553302043 in words is "five hundred fifty-three million, three hundred two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •