Base | Representation |
---|---|
bin | 11110101001111111001… |
… | …10100001111101100101 |
3 | 10201200211122212000121120 |
4 | 33110333212201331211 |
5 | 114224212004141314 |
6 | 2123521152204153 |
7 | 136046412502041 |
oct | 17247746417545 |
9 | 3650748760546 |
10 | 1053334052709 |
11 | 376797681104 |
12 | 150187539659 |
13 | 784379b1403 |
14 | 38da5899021 |
15 | 1c5edb888a9 |
hex | f53f9a1f65 |
1053334052709 has 8 divisors (see below), whose sum is σ = 1404946465632. Its totient is φ = 701972170800.
The previous prime is 1053334052671. The next prime is 1053334052711. The reversal of 1053334052709 is 9072504333501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1053334052709 - 217 = 1053333921637 is a prime.
It is a super-2 number, since 2×10533340527092 (a number of 25 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053334052759) 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, 62622942 + ... + 62639759.
It is an arithmetic number, because the mean of its divisors is an integer number (175618308204).
Almost surely, 21053334052709 is an apocalyptic number.
It is an amenable number.
1053334052709 is a deficient number, since it is larger than the sum of its proper divisors (351612412923).
1053334052709 is a wasteful number, since it uses less digits than its factorization.
1053334052709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125265507.
The product of its (nonzero) digits is 340200, while the sum is 42.
The spelling of 1053334052709 in words is "one trillion, fifty-three billion, three hundred thirty-four million, fifty-two thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •