Base | Representation |
---|---|
bin | 100100100000… |
… | …1111100011100 |
3 | 1100000122021200 |
4 | 1021001330130 |
5 | 14400110401 |
6 | 1522155500 |
7 | 321503541 |
oct | 111017434 |
9 | 40018250 |
10 | 19144476 |
11 | a89658a |
12 | 64b2b90 |
13 | 3c73bc0 |
14 | 2784bc8 |
15 | 1a32686 |
hex | 1241f1c |
19144476 has 72 divisors (see below), whose sum is σ = 54883920. Its totient is φ = 5577984.
The previous prime is 19144459. The next prime is 19144481. The reversal of 19144476 is 67444191.
It is a super-2 number, since 2×191444762 = 733021922629152, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 19144476.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 7816 + ... + 9968.
Almost surely, 219144476 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 19144476, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27441960).
19144476 is an abundant number, since it is smaller than the sum of its proper divisors (35739444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19144476 is a wasteful number, since it uses less digits than its factorization.
19144476 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2195 (or 2190 counting only the distinct ones).
The product of its digits is 24192, while the sum is 36.
The square root of 19144476 is about 4375.4400921507. The cubic root of 19144476 is about 267.5148086250.
The spelling of 19144476 in words is "nineteen million, one hundred forty-four thousand, four hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •