Base | Representation |
---|---|
bin | 111110101111111… |
… | …011011101111100 |
3 | 2201100221022220012 |
4 | 332233323131330 |
5 | 4124001023430 |
6 | 252244042352 |
7 | 35042146025 |
oct | 7657733574 |
9 | 2640838805 |
10 | 1052751740 |
11 | 4a0283a67 |
12 | 2546933b8 |
13 | 13a149c31 |
14 | 9db5dc4c |
15 | 62651695 |
hex | 3ebfb77c |
1052751740 has 12 divisors (see below), whose sum is σ = 2210778696. Its totient is φ = 421100688.
The previous prime is 1052751737. The next prime is 1052751769. The reversal of 1052751740 is 471572501.
It is a super-2 number, since 2×10527517402 = 2216572452146055200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1052751697 and 1052751706.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26318774 + ... + 26318813.
It is an arithmetic number, because the mean of its divisors is an integer number (184231558).
Almost surely, 21052751740 is an apocalyptic number.
1052751740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1052751740 is an abundant number, since it is smaller than the sum of its proper divisors (1158026956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1052751740 is a wasteful number, since it uses less digits than its factorization.
1052751740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52637596 (or 52637594 counting only the distinct ones).
The product of its (nonzero) digits is 9800, while the sum is 32.
The square root of 1052751740 is about 32446.1359794968. The cubic root of 1052751740 is about 1017.2834738990.
The spelling of 1052751740 in words is "one billion, fifty-two million, seven hundred fifty-one thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •