Base | Representation |
---|---|
bin | 11011000100010… |
… | …001000001101001 |
3 | 1011122110211102000 |
4 | 123010101001221 |
5 | 1412222300040 |
6 | 113021001213 |
7 | 14152545606 |
oct | 3304210151 |
9 | 1148424360 |
10 | 454103145 |
11 | 213369461 |
12 | 1080b3209 |
13 | 731054b2 |
14 | 444496ad |
15 | 29cee130 |
hex | 1b111069 |
454103145 has 32 divisors (see below), whose sum is σ = 842400000. Its totient is φ = 231656832.
The previous prime is 454103137. The next prime is 454103147. The reversal of 454103145 is 541301454.
It is a happy number.
It is not a de Polignac number, because 454103145 - 23 = 454103137 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (454103147) 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 31 ways as a sum of consecutive naturals, for example, 70020 + ... + 76229.
It is an arithmetic number, because the mean of its divisors is an integer number (26325000).
Almost surely, 2454103145 is an apocalyptic number.
454103145 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
454103145 is a deficient number, since it is larger than the sum of its proper divisors (388296855).
454103145 is a wasteful number, since it uses less digits than its factorization.
454103145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146286 (or 146280 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 454103145 is about 21309.6960325576. The cubic root of 454103145 is about 768.6314844068.
Adding to 454103145 its reverse (541301454), we get a palindrome (995404599).
The spelling of 454103145 in words is "four hundred fifty-four million, one hundred three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •