Base | Representation |
---|---|
bin | 111111000010010… |
… | …101000110101111 |
3 | 2201201000101122011 |
4 | 333002111012233 |
5 | 4131214402333 |
6 | 252535302051 |
7 | 35131146016 |
oct | 7702250657 |
9 | 2651011564 |
10 | 1057575343 |
11 | 4a2a79010 |
12 | 25621a927 |
13 | 13b148636 |
14 | a0657a7d |
15 | 62ca59cd |
hex | 3f0951af |
1057575343 has 16 divisors (see below), whose sum is σ = 1167916320. Its totient is φ = 949648000.
The previous prime is 1057575319. The next prime is 1057575347. The reversal of 1057575343 is 3435757501.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1057575343 - 221 = 1055478191 is a prime.
It is a super-2 number, since 2×10575753432 = 2236931212243135298, 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 = 1057575296 and 1057575305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1057575347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 617973 + ... + 619681.
It is an arithmetic number, because the mean of its divisors is an integer number (72994770).
Almost surely, 21057575343 is an apocalyptic number.
1057575343 is a deficient number, since it is larger than the sum of its proper divisors (110340977).
1057575343 is a wasteful number, since it uses less digits than its factorization.
1057575343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2378.
The product of its (nonzero) digits is 220500, while the sum is 40.
The square root of 1057575343 is about 32520.3835001988. The cubic root of 1057575343 is about 1018.8348039458.
The spelling of 1057575343 in words is "one billion, fifty-seven million, five hundred seventy-five thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •