Base | Representation |
---|---|
bin | 100100011100… |
… | …0101010001010 |
3 | 1022221201010000 |
4 | 1020320222022 |
5 | 14342401232 |
6 | 1521303430 |
7 | 321254625 |
oct | 110705212 |
9 | 38851100 |
10 | 19106442 |
11 | a86aa53 |
12 | 6494b76 |
13 | 3c5c7b4 |
14 | 2774dbc |
15 | 1a2627c |
hex | 1238a8a |
19106442 has 40 divisors (see below), whose sum is σ = 43560000. Its totient is φ = 6257736.
The previous prime is 19106441. The next prime is 19106489. The reversal of 19106442 is 24460191.
19106442 is a `hidden beast` number, since 1 + 9 + 10 + 644 + 2 = 666.
It is a super-2 number, since 2×191064422 = 730112251798728, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (19106441) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 8559 + ... + 10557.
It is an arithmetic number, because the mean of its divisors is an integer number (1089000).
Almost surely, 219106442 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19106442, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21780000).
19106442 is an abundant number, since it is smaller than the sum of its proper divisors (24453558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19106442 is a wasteful number, since it uses less digits than its factorization.
19106442 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2072 (or 2063 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 19106442 is about 4371.0916256697. The cubic root of 19106442 is about 267.3375354938.
The spelling of 19106442 in words is "nineteen million, one hundred six thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •