Base | Representation |
---|---|
bin | 111111000000100… |
… | …001100100101101 |
3 | 2201200010100111120 |
4 | 333000201210231 |
5 | 4131104232000 |
6 | 252521211153 |
7 | 35124135252 |
oct | 7700414455 |
9 | 2650110446 |
10 | 1057102125 |
11 | 4a2785522 |
12 | 256030ab9 |
13 | 13b011121 |
14 | a0573429 |
15 | 62c106a0 |
hex | 3f02192d |
1057102125 has 16 divisors (see below), whose sum is σ = 1759018560. Its totient is φ = 563787600.
The previous prime is 1057102097. The next prime is 1057102133. The reversal of 1057102125 is 5212017501.
It is not a de Polignac number, because 1057102125 - 25 = 1057102093 is a prime.
It is a super-2 number, since 2×10571021252 = 2234929805359031250, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1057102095 and 1057102104.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1409095 + ... + 1409844.
It is an arithmetic number, because the mean of its divisors is an integer number (109938660).
Almost surely, 21057102125 is an apocalyptic number.
1057102125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1057102125 is a deficient number, since it is larger than the sum of its proper divisors (701916435).
1057102125 is an equidigital number, since it uses as much as digits as its factorization.
1057102125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2818957 (or 2818947 counting only the distinct ones).
The product of its (nonzero) digits is 700, while the sum is 24.
The square root of 1057102125 is about 32513.1069724196. The cubic root of 1057102125 is about 1018.6828201651.
Adding to 1057102125 its reverse (5212017501), we get a palindrome (6269119626).
The spelling of 1057102125 in words is "one billion, fifty-seven million, one hundred two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •