Base | Representation |
---|---|
bin | 11011000100010… |
… | …000100111001101 |
3 | 1011122110202002100 |
4 | 123010100213031 |
5 | 1412222221303 |
6 | 113020545313 |
7 | 14152540641 |
oct | 3304204715 |
9 | 1148422070 |
10 | 454101453 |
11 | 213368163 |
12 | 1080b2239 |
13 | 731047b0 |
14 | 44448c21 |
15 | 29ced8a3 |
hex | 1b1109cd |
454101453 has 12 divisors (see below), whose sum is σ = 706380220. Its totient is φ = 279446976.
The previous prime is 454101449. The next prime is 454101493. The reversal of 454101453 is 354101454.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 222666084 + 231435369 = 14922^2 + 15213^2 .
It is not a de Polignac number, because 454101453 - 22 = 454101449 is a prime.
It is a super-2 number, since 2×4541014532 = 412416259233422418, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (454101493) 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 11 ways as a sum of consecutive naturals, for example, 1940488 + ... + 1940721.
Almost surely, 2454101453 is an apocalyptic number.
It is an amenable number.
454101453 is a deficient number, since it is larger than the sum of its proper divisors (252278767).
454101453 is a wasteful number, since it uses less digits than its factorization.
454101453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3881228 (or 3881225 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 454101453 is about 21309.6563322828. The cubic root of 454101453 is about 768.6305297587.
Subtracting from 454101453 its reverse (354101454), we obtain a palindrome (99999999).
The spelling of 454101453 in words is "four hundred fifty-four million, one hundred one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •