Base | Representation |
---|---|
bin | 111110101101100… |
… | …111010111010001 |
3 | 2201022210111202020 |
4 | 332231213113101 |
5 | 4123322120410 |
6 | 252223042053 |
7 | 35034041304 |
oct | 7655472721 |
9 | 2638714666 |
10 | 1052145105 |
11 | 49a9aa210 |
12 | 254440329 |
13 | 139c96a8b |
14 | 9da42b3b |
15 | 62581a70 |
hex | 3eb675d1 |
1052145105 has 16 divisors (see below), whose sum is σ = 1836471744. Its totient is φ = 510130880.
The previous prime is 1052145047. The next prime is 1052145109. The reversal of 1052145105 is 5015412501.
It is not a de Polignac number, because 1052145105 - 221 = 1050047953 is a prime.
It is a super-2 number, since 2×10521451052 = 2214018643950922050, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1052145109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3188154 + ... + 3188483.
It is an arithmetic number, because the mean of its divisors is an integer number (114779484).
Almost surely, 21052145105 is an apocalyptic number.
1052145105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1052145105 is a deficient number, since it is larger than the sum of its proper divisors (784326639).
1052145105 is a wasteful number, since it uses less digits than its factorization.
1052145105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6376656.
The product of its (nonzero) digits is 1000, while the sum is 24.
The square root of 1052145105 is about 32436.7862927263. The cubic root of 1052145105 is about 1017.0880374029.
Adding to 1052145105 its reverse (5015412501), we get a palindrome (6067557606).
The spelling of 1052145105 in words is "one billion, fifty-two million, one hundred forty-five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •