Base | Representation |
---|---|
bin | 111110101101001… |
… | …001101101100010 |
3 | 2201022120100010220 |
4 | 332231021231202 |
5 | 4123304224100 |
6 | 252220303510 |
7 | 35033024226 |
oct | 7655115542 |
9 | 2638510126 |
10 | 1052023650 |
11 | 49a926a37 |
12 | 2543a1b96 |
13 | 139c53702 |
14 | 9da10786 |
15 | 6255aaa0 |
hex | 3eb49b62 |
1052023650 has 24 divisors (see below), whose sum is σ = 2609019024. Its totient is φ = 280539600.
The previous prime is 1052023619. The next prime is 1052023697. The reversal of 1052023650 is 563202501.
It is a super-2 number, since 2×10520236502 = 2213507520318645000, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1052023650.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 3506596 + ... + 3506895.
It is an arithmetic number, because the mean of its divisors is an integer number (108709126).
Almost surely, 21052023650 is an apocalyptic number.
1052023650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1052023650 is an abundant number, since it is smaller than the sum of its proper divisors (1556995374).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1052023650 is a wasteful number, since it uses less digits than its factorization.
1052023650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7013506 (or 7013501 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 1052023650 is about 32434.9140587731. The cubic root of 1052023650 is about 1017.0488998415.
The spelling of 1052023650 in words is "one billion, fifty-two million, twenty-three thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •