Base | Representation |
---|---|
bin | 111100110011011… |
… | …011100001001100 |
3 | 2122002112012201210 |
4 | 330303123201030 |
5 | 4042122140040 |
6 | 245120334420 |
7 | 34164556161 |
oct | 7463334114 |
9 | 2562465653 |
10 | 1020115020 |
11 | 483912571 |
12 | 245774410 |
13 | 133460a72 |
14 | 996a6068 |
15 | 5e856480 |
hex | 3ccdb84c |
1020115020 has 48 divisors (see below), whose sum is σ = 2954820960. Its totient is φ = 262649856.
The previous prime is 1020115003. The next prime is 1020115027. The reversal of 1020115020 is 205110201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 1020114987 and 1020115005.
It is not an unprimeable number, because it can be changed into a prime (1020115027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 291397 + ... + 294876.
It is an arithmetic number, because the mean of its divisors is an integer number (61558770).
Almost surely, 21020115020 is an apocalyptic number.
1020115020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1020115020 is an abundant number, since it is smaller than the sum of its proper divisors (1934705940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020115020 is a wasteful number, since it uses less digits than its factorization.
1020115020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 586314 (or 586312 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 12.
The square root of 1020115020 is about 31939.2395025304. The cubic root of 1020115020 is about 1006.6605453092.
Adding to 1020115020 its reverse (205110201), we get a palindrome (1225225221).
The spelling of 1020115020 in words is "one billion, twenty million, one hundred fifteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •