Base | Representation |
---|---|
bin | 11011000010001… |
… | …100101100000001 |
3 | 1011121110021211212 |
4 | 123002030230001 |
5 | 1412102423324 |
6 | 113001215505 |
7 | 14145130352 |
oct | 3302145401 |
9 | 1147407755 |
10 | 453561089 |
11 | 213029183 |
12 | 107a91595 |
13 | 72c75857 |
14 | 44347d29 |
15 | 29c4370e |
hex | 1b08cb01 |
453561089 has 4 divisors (see below), whose sum is σ = 453663300. Its totient is φ = 453458880.
The previous prime is 453561079. The next prime is 453561107. The reversal of 453561089 is 980165354.
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 243890689 + 209670400 = 15617^2 + 14480^2 .
It is a cyclic number.
It is not a de Polignac number, because 453561089 - 212 = 453556993 is a prime.
It is a super-2 number, since 2×4535610892 = 411435322909731842, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (453561079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44132 + ... + 53429.
It is an arithmetic number, because the mean of its divisors is an integer number (113415825).
Almost surely, 2453561089 is an apocalyptic number.
It is an amenable number.
453561089 is a deficient number, since it is larger than the sum of its proper divisors (102211).
453561089 is an equidigital number, since it uses as much as digits as its factorization.
453561089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102210.
The product of its (nonzero) digits is 129600, while the sum is 41.
The square root of 453561089 is about 21296.9737052005. The cubic root of 453561089 is about 768.3255280751.
The spelling of 453561089 in words is "four hundred fifty-three million, five hundred sixty-one thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •