Base | Representation |
---|---|
bin | 111110101101100… |
… | …100101111010001 |
3 | 2201022202222000000 |
4 | 332231210233101 |
5 | 4123321244403 |
6 | 252222520213 |
7 | 35033665044 |
oct | 7655445721 |
9 | 2638688000 |
10 | 1052134353 |
11 | 49a9a2126 |
12 | 254436069 |
13 | 139c91c0a |
14 | 9da3cc5b |
15 | 6257d7a3 |
hex | 3eb64bd1 |
1052134353 has 14 divisors (see below), whose sum is σ = 1577480994. Its totient is φ = 701422416.
The previous prime is 1052134351. The next prime is 1052134373. The reversal of 1052134353 is 3534312501.
1052134353 is a `hidden beast` number, since 10 + 5 + 213 + 435 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 949071249 + 103063104 = 30807^2 + 10152^2 .
It is not a de Polignac number, because 1052134353 - 21 = 1052134351 is a prime.
It is a super-2 number, since 2×10521343532 = 2213973393525457218, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1052134351) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 720900 + ... + 722357.
Almost surely, 21052134353 is an apocalyptic number.
It is an amenable number.
1052134353 is a deficient number, since it is larger than the sum of its proper divisors (525346641).
1052134353 is an frugal number, since it uses more digits than its factorization.
1052134353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1443275 (or 1443260 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The square root of 1052134353 is about 32436.6205545522. The cubic root of 1052134353 is about 1017.0845728086.
Adding to 1052134353 its reverse (3534312501), we get a palindrome (4586446854).
The spelling of 1052134353 in words is "one billion, fifty-two million, one hundred thirty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •