Base | Representation |
---|---|
bin | 10010000100010… |
… | …001110011111101 |
3 | 210010100122200221 |
4 | 102010101303331 |
5 | 1110044031141 |
6 | 50024421341 |
7 | 10340255524 |
oct | 2204216375 |
9 | 703318627 |
10 | 303111421 |
11 | 14610a108 |
12 | 85617851 |
13 | 4aa4a092 |
14 | 2c3834bb |
15 | 1b925bd1 |
hex | 12111cfd |
303111421 has 4 divisors (see below), whose sum is σ = 303644700. Its totient is φ = 302578144.
The previous prime is 303111409. The next prime is 303111443. The reversal of 303111421 is 124111303.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79459396 + 223652025 = 8914^2 + 14955^2 .
It is a cyclic number.
It is not a de Polignac number, because 303111421 - 221 = 301014269 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 303111395 and 303111404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (303111481) 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, 265786 + ... + 266923.
It is an arithmetic number, because the mean of its divisors is an integer number (75911175).
Almost surely, 2303111421 is an apocalyptic number.
It is an amenable number.
303111421 is a deficient number, since it is larger than the sum of its proper divisors (533279).
303111421 is an equidigital number, since it uses as much as digits as its factorization.
303111421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 533278.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 303111421 is about 17410.0953759593. The cubic root of 303111421 is about 671.7393146618.
Adding to 303111421 its reverse (124111303), we get a palindrome (427222724).
The spelling of 303111421 in words is "three hundred three million, one hundred eleven thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •