Base | Representation |
---|---|
bin | 111111000000100… |
… | …010010011101101 |
3 | 2201200010111121222 |
4 | 333000202103231 |
5 | 4131104331013 |
6 | 252521233125 |
7 | 35124150110 |
oct | 7700422355 |
9 | 2650114558 |
10 | 1057105133 |
11 | 4a2787807 |
12 | 2560327a5 |
13 | 13b0125c6 |
14 | a0574577 |
15 | 62c11508 |
hex | 3f0224ed |
1057105133 has 8 divisors (see below), whose sum is σ = 1240772352. Its totient is φ = 881600976.
The previous prime is 1057105123. The next prime is 1057105141. The reversal of 1057105133 is 3315017501.
1057105133 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 1057105133 - 24 = 1057105117 is a prime.
It is a super-2 number, since 2×10571051332 = 2234942524429895378, 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 (1057105123) 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, 2040485 + ... + 2041002.
It is an arithmetic number, because the mean of its divisors is an integer number (155096544).
Almost surely, 21057105133 is an apocalyptic number.
It is an amenable number.
1057105133 is a deficient number, since it is larger than the sum of its proper divisors (183667219).
1057105133 is an equidigital number, since it uses as much as digits as its factorization.
1057105133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4081531.
The product of its (nonzero) digits is 1575, while the sum is 26.
The square root of 1057105133 is about 32513.1532306542. The cubic root of 1057105133 is about 1018.6837863900.
The spelling of 1057105133 in words is "one billion, fifty-seven million, one hundred five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •