Base | Representation |
---|---|
bin | 1000110100101000000… |
… | …10100010001100001100 |
3 | 1001222102202012210010202 |
4 | 10122110002202030030 |
5 | 14431303114344040 |
6 | 351131233553032 |
7 | 30620610261245 |
oct | 4322402421414 |
9 | 1058382183122 |
10 | 303131403020 |
11 | 107614857786 |
12 | 4a8ba115778 |
13 | 2277b8003c4 |
14 | 10958d91ccc |
15 | 7d4255c015 |
hex | 46940a230c |
303131403020 has 48 divisors (see below), whose sum is σ = 643900211136. Its totient is φ = 119861280000.
The previous prime is 303131403013. The next prime is 303131403023. The reversal of 303131403020 is 20304131303.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 303131402983 and 303131403001.
It is not an unprimeable number, because it can be changed into a prime (303131403023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1155710 + ... + 1393530.
It is an arithmetic number, because the mean of its divisors is an integer number (13414587732).
Almost surely, 2303131403020 is an apocalyptic number.
It is an amenable number.
303131403020 is an abundant number, since it is smaller than the sum of its proper divisors (340768808116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
303131403020 is a wasteful number, since it uses less digits than its factorization.
303131403020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238562 (or 238560 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 303131403020 its reverse (20304131303), we get a palindrome (323435534323).
The spelling of 303131403020 in words is "three hundred three billion, one hundred thirty-one million, four hundred three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •