Base | Representation |
---|---|
bin | 100101000111… |
… | …1000000101110 |
3 | 1100121200022000 |
4 | 1022033000232 |
5 | 14440211032 |
6 | 1533033130 |
7 | 324260052 |
oct | 112170056 |
9 | 40550260 |
10 | 19460142 |
11 | aa91769 |
12 | 66257a6 |
13 | 40547a0 |
14 | 2827c62 |
15 | 1a95e7c |
hex | 128f02e |
19460142 has 64 divisors (see below), whose sum is σ = 49056000. Its totient is φ = 5668704.
The previous prime is 19460101. The next prime is 19460143. The reversal of 19460142 is 24106491.
19460142 is a `hidden beast` number, since 19 + 4 + 601 + 42 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19460143) 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 31 ways as a sum of consecutive naturals, for example, 12609 + ... + 14067.
It is an arithmetic number, because the mean of its divisors is an integer number (766500).
Almost surely, 219460142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19460142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24528000).
19460142 is an abundant number, since it is smaller than the sum of its proper divisors (29595858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19460142 is a wasteful number, since it uses less digits than its factorization.
19460142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1502 (or 1496 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 19460142 is about 4411.3650948431. The cubic root of 19460142 is about 268.9771174042.
The spelling of 19460142 in words is "nineteen million, four hundred sixty thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •