Base | Representation |
---|---|
bin | 111110101101000… |
… | …111011000100011 |
3 | 2201022112212001202 |
4 | 332231013120203 |
5 | 4123303422430 |
6 | 252220151415 |
7 | 35032654355 |
oct | 7655073043 |
9 | 2638485052 |
10 | 1052014115 |
11 | 49a91a859 |
12 | 25439856b |
13 | 139c4c279 |
14 | 9da0b0d5 |
15 | 62557d45 |
hex | 3eb47623 |
1052014115 has 4 divisors (see below), whose sum is σ = 1262416944. Its totient is φ = 841611288.
The previous prime is 1052014099. The next prime is 1052014129. The reversal of 1052014115 is 5114102501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5114102501 = 1663 ⋅3075227.
It is a cyclic number.
It is not a de Polignac number, because 1052014115 - 24 = 1052014099 is a prime.
It is a super-2 number, since 2×10520141152 = 2213467396318466450, which contains 22 as substring.
It is a Duffinian number.
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 3 ways as a sum of consecutive naturals, for example, 105201407 + ... + 105201416.
It is an arithmetic number, because the mean of its divisors is an integer number (315604236).
Almost surely, 21052014115 is an apocalyptic number.
1052014115 is a deficient number, since it is larger than the sum of its proper divisors (210402829).
1052014115 is an equidigital number, since it uses as much as digits as its factorization.
1052014115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210402828.
The product of its (nonzero) digits is 200, while the sum is 20.
The square root of 1052014115 is about 32434.7670717704. The cubic root of 1052014115 is about 1017.0458271632.
Adding to 1052014115 its reverse (5114102501), we get a palindrome (6166116616).
The spelling of 1052014115 in words is "one billion, fifty-two million, fourteen thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •