Base | Representation |
---|---|
bin | 1001000011011111001… |
… | …10110110110000000100 |
3 | 1002202000210112200120010 |
4 | 10201233212312300010 |
5 | 20044123141231040 |
6 | 354531053110220 |
7 | 31322412143334 |
oct | 4415746666004 |
9 | 1082023480503 |
10 | 311110102020 |
11 | 10aa395a63a3 |
12 | 50366188370 |
13 | 234507c5b83 |
14 | 110b48b30c4 |
15 | 815cc4ae80 |
hex | 486f9b6c04 |
311110102020 has 48 divisors (see below), whose sum is σ = 873074744640. Its totient is φ = 82775412096.
The previous prime is 311110102013. The next prime is 311110102021. The reversal of 311110102020 is 20201011113.
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 = 311110101987 and 311110102005.
It is not an unprimeable number, because it can be changed into a prime (311110102021) 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, 5825755 + ... + 5878914.
It is an arithmetic number, because the mean of its divisors is an integer number (18189057180).
Almost surely, 2311110102020 is an apocalyptic number.
311110102020 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
311110102020 is an abundant number, since it is smaller than the sum of its proper divisors (561964642620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
311110102020 is a wasteful number, since it uses less digits than its factorization.
311110102020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11705124 (or 11705122 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 311110102020 its reverse (20201011113), we get a palindrome (331311113133).
The spelling of 311110102020 in words is "three hundred eleven billion, one hundred ten million, one hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •