Base | Representation |
---|---|
bin | 111100110011001… |
… | …100001010010011 |
3 | 2122002102000102222 |
4 | 330303030022103 |
5 | 4042113131430 |
6 | 245115131255 |
7 | 34164204605 |
oct | 7463141223 |
9 | 2562360388 |
10 | 1020052115 |
11 | 48387a285 |
12 | 245743b2b |
13 | 13343b244 |
14 | 9968b175 |
15 | 5e8429e5 |
hex | 3cccc293 |
1020052115 has 8 divisors (see below), whose sum is σ = 1231139088. Its totient is φ = 811324000.
The previous prime is 1020052109. The next prime is 1020052123. The reversal of 1020052115 is 5112500201.
1020052115 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1020052115 is a prime.
It is a super-3 number, since 3×10200521153 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020052093 and 1020052102.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 588761 + ... + 590490.
It is an arithmetic number, because the mean of its divisors is an integer number (153892386).
Almost surely, 21020052115 is an apocalyptic number.
1020052115 is a deficient number, since it is larger than the sum of its proper divisors (211086973).
1020052115 is a wasteful number, since it uses less digits than its factorization.
1020052115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1179429.
The product of its (nonzero) digits is 100, while the sum is 17.
The square root of 1020052115 is about 31938.2547268945. The cubic root of 1020052115 is about 1006.6398531056.
Adding to 1020052115 its reverse (5112500201), we get a palindrome (6132552316).
The spelling of 1020052115 in words is "one billion, twenty million, fifty-two thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •