Base | Representation |
---|---|
bin | 11011000100101… |
… | …011101001000001 |
3 | 1011122200100221122 |
4 | 123010223221001 |
5 | 1412234242121 |
6 | 113023202025 |
7 | 14153511464 |
oct | 3304535101 |
9 | 1148610848 |
10 | 454212161 |
11 | 213433357 |
12 | 108146315 |
13 | 73142cc0 |
14 | 444772db |
15 | 29d215ab |
hex | 1b12ba41 |
454212161 has 8 divisors (see below), whose sum is σ = 497171304. Its totient is φ = 412398720.
The previous prime is 454212151. The next prime is 454212191. The reversal of 454212161 is 161212454.
It can be written as a sum of positive squares in 4 ways, for example, as 309136 + 453903025 = 556^2 + 21305^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 454212161 - 26 = 454212097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 454212161.
It is not an unprimeable number, because it can be changed into a prime (454212151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 285596 + ... + 287181.
It is an arithmetic number, because the mean of its divisors is an integer number (62146413).
Almost surely, 2454212161 is an apocalyptic number.
It is an amenable number.
454212161 is a deficient number, since it is larger than the sum of its proper divisors (42959143).
454212161 is a wasteful number, since it uses less digits than its factorization.
454212161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 572851.
The product of its digits is 1920, while the sum is 26.
The square root of 454212161 is about 21312.2537757038. The cubic root of 454212161 is about 768.6929876330.
The spelling of 454212161 in words is "four hundred fifty-four million, two hundred twelve thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •