Base | Representation |
---|---|
bin | 100100010010… |
… | …0111000001111 |
3 | 1022210120222022 |
4 | 1020210320033 |
5 | 14332303143 |
6 | 1515440355 |
7 | 320466464 |
oct | 110447017 |
9 | 38716868 |
10 | 19025423 |
11 | a81509a |
12 | 64560bb |
13 | 3c31961 |
14 | 275366b |
15 | 1a0c268 |
hex | 1224e0f |
19025423 has 4 divisors (see below), whose sum is σ = 19034808. Its totient is φ = 19016040.
The previous prime is 19025399. The next prime is 19025429. The reversal of 19025423 is 32452091.
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: 32452091 = 7 ⋅4636013.
It is a cyclic number.
It is not a de Polignac number, because 19025423 - 26 = 19025359 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 19025392 and 19025401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19025429) 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, 248 + ... + 6173.
It is an arithmetic number, because the mean of its divisors is an integer number (4758702).
Almost surely, 219025423 is an apocalyptic number.
19025423 is a deficient number, since it is larger than the sum of its proper divisors (9385).
19025423 is an equidigital number, since it uses as much as digits as its factorization.
19025423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9384.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 19025423 is about 4361.8141867805. The cubic root of 19025423 is about 266.9591272236.
The spelling of 19025423 in words is "nineteen million, twenty-five thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •