Base | Representation |
---|---|
bin | 100110110101011… |
… | …1110010101101100 |
3 | 10100211000220021010 |
4 | 1031222332111230 |
5 | 10132044023040 |
6 | 333150105220 |
7 | 44202155331 |
oct | 11552762554 |
9 | 3324026233 |
10 | 1303111020 |
11 | 609632662 |
12 | 3044ab210 |
13 | 179c87013 |
14 | c50d0988 |
15 | 79606e80 |
hex | 4dabe56c |
1303111020 has 48 divisors (see below), whose sum is σ = 3670587648. Its totient is φ = 345412800.
The previous prime is 1303111003. The next prime is 1303111021. The reversal of 1303111020 is 201113031.
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 = 1303110987 and 1303111005.
It is not an unprimeable number, because it can be changed into a prime (1303111021) 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, 55006 + ... + 75045.
It is an arithmetic number, because the mean of its divisors is an integer number (76470576).
Almost surely, 21303111020 is an apocalyptic number.
1303111020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1303111020 is an abundant number, since it is smaller than the sum of its proper divisors (2367476628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1303111020 is a wasteful number, since it uses less digits than its factorization.
1303111020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130230 (or 130228 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 1303111020 is about 36098.6290598410. The cubic root of 1303111020 is about 1092.2627908109.
Adding to 1303111020 its reverse (201113031), we get a palindrome (1504224051).
The spelling of 1303111020 in words is "one billion, three hundred three million, one hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •