Base | Representation |
---|---|
bin | 1000110010100001100… |
… | …10000110000101001111 |
3 | 1001212112002221222210011 |
4 | 10121100302012011033 |
5 | 14422000233120421 |
6 | 350423244454051 |
7 | 30550626213202 |
oct | 4312062060517 |
9 | 1055462858704 |
10 | 302003020111 |
11 | 107095916a21 |
12 | 4a64424a327 |
13 | 2262bac2800 |
14 | 1088d185939 |
15 | 7cc846b4e1 |
hex | 4650c8614f |
302003020111 has 6 divisors (see below), whose sum is σ = 327021021960. Its totient is φ = 278772018408.
The previous prime is 302003020103. The next prime is 302003020141. The reversal of 302003020111 is 111020300203.
It is not a de Polignac number, because 302003020111 - 23 = 302003020103 is a prime.
It is a super-3 number, since 3×3020030201113 (a number of 35 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 302003020091 and 302003020100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302003020141) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 893499891 + ... + 893500228.
It is an arithmetic number, because the mean of its divisors is an integer number (54503503660).
Almost surely, 2302003020111 is an apocalyptic number.
302003020111 is a deficient number, since it is larger than the sum of its proper divisors (25018001849).
302003020111 is a wasteful number, since it uses less digits than its factorization.
302003020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1787000145 (or 1787000132 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 302003020111 its reverse (111020300203), we get a palindrome (413023320314).
The spelling of 302003020111 in words is "three hundred two billion, three million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •