Base | Representation |
---|---|
bin | 111110110010001… |
… | …010010001010101 |
3 | 2201102001001020221 |
4 | 332302022101111 |
5 | 4124123233121 |
6 | 252304354341 |
7 | 35050133236 |
oct | 7662122125 |
9 | 2642031227 |
10 | 1053336661 |
11 | 4a0643473 |
12 | 2549159b1 |
13 | 13a2c3240 |
14 | 9dc7308d |
15 | 62719b41 |
hex | 3ec8a455 |
1053336661 has 8 divisors (see below), whose sum is σ = 1135549184. Its totient is φ = 971293680.
The previous prime is 1053336659. The next prime is 1053336667. The reversal of 1053336661 is 1666333501.
1053336661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1053336661 - 21 = 1053336659 is a prime.
It is a super-2 number, since 2×10533366612 = 2219036242813257842, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053336667) 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, 29325 + ... + 54466.
It is an arithmetic number, because the mean of its divisors is an integer number (141943648).
Almost surely, 21053336661 is an apocalyptic number.
It is an amenable number.
1053336661 is a deficient number, since it is larger than the sum of its proper divisors (82212523).
1053336661 is an equidigital number, since it uses as much as digits as its factorization.
1053336661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84771.
The product of its (nonzero) digits is 29160, while the sum is 34.
The square root of 1053336661 is about 32455.1484513628. The cubic root of 1053336661 is about 1017.4718438240.
The spelling of 1053336661 in words is "one billion, fifty-three million, three hundred thirty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •