Base | Representation |
---|---|
bin | 11011000101101… |
… | …010011000100001 |
3 | 1011200011102110212 |
4 | 123011222120201 |
5 | 1412321003103 |
6 | 113032503505 |
7 | 14155631645 |
oct | 3305523041 |
9 | 1150142425 |
10 | 454469153 |
11 | 213599446 |
12 | 10824ab95 |
13 | 73202c78 |
14 | 44502c25 |
15 | 29d727d8 |
hex | 1b16a621 |
454469153 has 8 divisors (see below), whose sum is σ = 466942560. Its totient is φ = 442154880.
The previous prime is 454469149. The next prime is 454469159. The reversal of 454469153 is 351964454.
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 454469153 - 22 = 454469149 is a prime.
It is a super-2 number, since 2×4544691532 = 413084422057074818, which contains 22 as substring.
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 454469153.
It is not an unprimeable number, because it can be changed into a prime (454469159) 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, 33983 + ... + 45428.
It is an arithmetic number, because the mean of its divisors is an integer number (58367820).
Almost surely, 2454469153 is an apocalyptic number.
It is an amenable number.
454469153 is a deficient number, since it is larger than the sum of its proper divisors (12473407).
454469153 is an equidigital number, since it uses as much as digits as its factorization.
454469153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79567.
The product of its digits is 259200, while the sum is 41.
The square root of 454469153 is about 21318.2821306033. The cubic root of 454469153 is about 768.8379350971.
The spelling of 454469153 in words is "four hundred fifty-four million, four hundred sixty-nine thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •