Base | Representation |
---|---|
bin | 11011000100101… |
… | …101110110111001 |
3 | 1011122200211101221 |
4 | 123010231312321 |
5 | 1412240034431 |
6 | 113023312041 |
7 | 14153550115 |
oct | 3304556671 |
9 | 1148624357 |
10 | 454221241 |
11 | 21343a161 |
12 | 10814b621 |
13 | 73147186 |
14 | 4447a745 |
15 | 29d24111 |
hex | 1b12ddb9 |
454221241 has 4 divisors (see below), whose sum is σ = 458241012. Its totient is φ = 450201472.
The previous prime is 454221233. The next prime is 454221263. The reversal of 454221241 is 142122454.
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 49406841 + 404814400 = 7029^2 + 20120^2 .
It is a cyclic number.
It is not a de Polignac number, because 454221241 - 23 = 454221233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (454221211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2009716 + ... + 2009941.
It is an arithmetic number, because the mean of its divisors is an integer number (114560253).
Almost surely, 2454221241 is an apocalyptic number.
It is an amenable number.
454221241 is a deficient number, since it is larger than the sum of its proper divisors (4019771).
454221241 is a wasteful number, since it uses less digits than its factorization.
454221241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4019770.
The product of its digits is 2560, while the sum is 25.
The square root of 454221241 is about 21312.4667976281. The cubic root of 454221241 is about 768.6981098251.
Adding to 454221241 its reverse (142122454), we get a palindrome (596343695).
The spelling of 454221241 in words is "four hundred fifty-four million, two hundred twenty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •