Base | Representation |
---|---|
bin | 100100010010… |
… | …0110110111000 |
3 | 1022210120212002 |
4 | 1020210312320 |
5 | 14332302321 |
6 | 1515440132 |
7 | 320466311 |
oct | 110446670 |
9 | 38716762 |
10 | 19025336 |
11 | a815020 |
12 | 6456048 |
13 | 3c318c5 |
14 | 2753608 |
15 | 1a0c20b |
hex | 1224db8 |
19025336 has 32 divisors (see below), whose sum is σ = 39312000. Its totient is φ = 8559840.
The previous prime is 19025323. The next prime is 19025339. The reversal of 19025336 is 63352091.
It is a junction number, because it is equal to n+sod(n) for n = 19025299 and 19025308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19025339) 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, 8015 + ... + 10113.
It is an arithmetic number, because the mean of its divisors is an integer number (1228500).
Almost surely, 219025336 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19025336, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19656000).
19025336 is an abundant number, since it is smaller than the sum of its proper divisors (20286664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19025336 is a wasteful number, since it uses less digits than its factorization.
19025336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2219 (or 2215 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 29.
The square root of 19025336 is about 4361.8042138546. The cubic root of 19025336 is about 266.9587203035.
The spelling of 19025336 in words is "nineteen million, twenty-five thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •