Base | Representation |
---|---|
bin | 10001111101110… |
… | …100111010111101 |
3 | 210000011201210220 |
4 | 101331310322331 |
5 | 1104130421341 |
6 | 45524251553 |
7 | 10320013104 |
oct | 2175647275 |
9 | 700151726 |
10 | 301420221 |
11 | 145164523 |
12 | 84b40bb9 |
13 | 4a5a737b |
14 | 2c06303b |
15 | 1b6dea66 |
hex | 11f74ebd |
301420221 has 8 divisors (see below), whose sum is σ = 419367360. Its totient is φ = 192209952.
The previous prime is 301420219. The next prime is 301420253. The reversal of 301420221 is 122024103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 301420221 - 21 = 301420219 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 301420221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301420201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2184136 + ... + 2184273.
It is an arithmetic number, because the mean of its divisors is an integer number (52420920).
Almost surely, 2301420221 is an apocalyptic number.
It is an amenable number.
301420221 is a deficient number, since it is larger than the sum of its proper divisors (117947139).
301420221 is a wasteful number, since it uses less digits than its factorization.
301420221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4368435.
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 301420221 is about 17361.4579168917. The cubic root of 301420221 is about 670.4876682744.
Adding to 301420221 its reverse (122024103), we get a palindrome (423444324).
The spelling of 301420221 in words is "three hundred one million, four hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •