Base | Representation |
---|---|
bin | 111110101111000… |
… | …000110011001010 |
3 | 2201100111010020222 |
4 | 332233000303022 |
5 | 4123420331214 |
6 | 252234550042 |
7 | 35040125312 |
oct | 7657006312 |
9 | 2640433228 |
10 | 1052511434 |
11 | 4a012a467 |
12 | 254598322 |
13 | 13a094740 |
14 | 9dada442 |
15 | 6260538e |
hex | 3ebc0cca |
1052511434 has 8 divisors (see below), whose sum is σ = 1700210820. Its totient is φ = 485774496.
The previous prime is 1052511433. The next prime is 1052511437. The reversal of 1052511434 is 4341152501.
It can be written as a sum of positive squares in 2 ways, for example, as 775455409 + 277056025 = 27847^2 + 16645^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10525114342 = 2215560637401472712, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 40481209 = 1052511434 / (1 + 0 + 5 + 2 + 5 + 1 + 1 + 4 + 3 + 4).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1052511433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20240579 + ... + 20240630.
Almost surely, 21052511434 is an apocalyptic number.
1052511434 is a deficient number, since it is larger than the sum of its proper divisors (647699386).
1052511434 is a wasteful number, since it uses less digits than its factorization.
1052511434 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40481224.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 1052511434 is about 32442.4326153265. The cubic root of 1052511434 is about 1017.2060647258.
Adding to 1052511434 its reverse (4341152501), we get a palindrome (5393663935).
The spelling of 1052511434 in words is "one billion, fifty-two million, five hundred eleven thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •