Base | Representation |
---|---|
bin | 11011000001110… |
… | …000001000100011 |
3 | 1011121020100102002 |
4 | 123001300020203 |
5 | 1412040203011 |
6 | 112554514215 |
7 | 14144132360 |
oct | 3301601043 |
9 | 1147210362 |
10 | 453444131 |
11 | 212a59318 |
12 | 107a3596b |
13 | 72c3454a |
14 | 44317467 |
15 | 29c1dc3b |
hex | 1b070223 |
453444131 has 8 divisors (see below), whose sum is σ = 518353920. Its totient is φ = 388567368.
The previous prime is 453444067. The next prime is 453444137. The reversal of 453444131 is 131444354.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 453444131 - 26 = 453444067 is a prime.
It is a super-2 number, since 2×4534441312 = 411223159876690322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 453444094 and 453444103.
It is not an unprimeable number, because it can be changed into a prime (453444137) 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 7 ways as a sum of consecutive naturals, for example, 39950 + ... + 50028.
It is an arithmetic number, because the mean of its divisors is an integer number (64794240).
Almost surely, 2453444131 is an apocalyptic number.
453444131 is a deficient number, since it is larger than the sum of its proper divisors (64909789).
453444131 is a wasteful number, since it uses less digits than its factorization.
453444131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16513.
The product of its digits is 11520, while the sum is 29.
The square root of 453444131 is about 21294.2276450685. The cubic root of 453444131 is about 768.2594807116.
Adding to 453444131 its reverse (131444354), we get a palindrome (584888485).
The spelling of 453444131 in words is "four hundred fifty-three million, four hundred forty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •