Base | Representation |
---|---|
bin | 1000110010100010100… |
… | …00100101010000001111 |
3 | 1001212112200000000202011 |
4 | 10121101100211100033 |
5 | 14422004304341421 |
6 | 350424132042051 |
7 | 30551054150404 |
oct | 4312120452017 |
9 | 1055480000664 |
10 | 302011012111 |
11 | 10709a385486 |
12 | 4a646a63327 |
13 | 226306603c3 |
14 | 108902662ab |
15 | 7cc8ee94e1 |
hex | 465142540f |
302011012111 has 4 divisors (see below), whose sum is σ = 302022713512. Its totient is φ = 301999310712.
The previous prime is 302011012091. The next prime is 302011012129. The reversal of 302011012111 is 111210110203.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111210110203 = 5039 ⋅22069877.
It is a cyclic number.
It is not a de Polignac number, because 302011012111 - 215 = 302010979343 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 302011012091 and 302011012100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302011012181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5811900 + ... + 5863633.
It is an arithmetic number, because the mean of its divisors is an integer number (75505678378).
Almost surely, 2302011012111 is an apocalyptic number.
302011012111 is a deficient number, since it is larger than the sum of its proper divisors (11701401).
302011012111 is a wasteful number, since it uses less digits than its factorization.
302011012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11701400.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 302011012111 its reverse (111210110203), we get a palindrome (413221122314).
The spelling of 302011012111 in words is "three hundred two billion, eleven million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •