Base | Representation |
---|---|
bin | 100100101010… |
… | …1011001001001 |
3 | 1100011200120002 |
4 | 1021111121021 |
5 | 14410133022 |
6 | 1524012345 |
7 | 322255022 |
oct | 111253111 |
9 | 40150502 |
10 | 19224137 |
11 | a940419 |
12 | 65310b5 |
13 | 3ca123a |
14 | 27a5c49 |
15 | 1a4b092 |
hex | 1255649 |
19224137 has 4 divisors (see below), whose sum is σ = 19235220. Its totient is φ = 19213056.
The previous prime is 19224133. The next prime is 19224167. The reversal of 19224137 is 73142291.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 73142291 = 919 ⋅79589.
It can be written as a sum of positive squares in 2 ways, for example, as 1042441 + 18181696 = 1021^2 + 4264^2 .
It is a cyclic number.
It is not a de Polignac number, because 19224137 - 22 = 19224133 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (19224133) 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, 2312 + ... + 6617.
It is an arithmetic number, because the mean of its divisors is an integer number (4808805).
Almost surely, 219224137 is an apocalyptic number.
It is an amenable number.
19224137 is a deficient number, since it is larger than the sum of its proper divisors (11083).
19224137 is an equidigital number, since it uses as much as digits as its factorization.
19224137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11082.
The product of its digits is 3024, while the sum is 29.
The square root of 19224137 is about 4384.5338406722. The cubic root of 19224137 is about 267.8853420944.
The spelling of 19224137 in words is "nineteen million, two hundred twenty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •