Base | Representation |
---|---|
bin | 100101011110… |
… | …1001000011100 |
3 | 1100222021102200 |
4 | 1022331020130 |
5 | 20012232202 |
6 | 1541051500 |
7 | 326004603 |
oct | 112751034 |
9 | 40867380 |
10 | 19649052 |
11 | 10100695 |
12 | 66b6b90 |
13 | 40bc777 |
14 | 2876a3a |
15 | 1ad1e1c |
hex | 12bd21c |
19649052 has 36 divisors (see below), whose sum is σ = 50142456. Its totient is φ = 6487200.
The previous prime is 19649051. The next prime is 19649057. The reversal of 19649052 is 25094691.
19649052 is a `hidden beast` number, since 1 + 9 + 649 + 0 + 5 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 19648998 and 19649016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19649051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1302 + ... + 6402.
It is an arithmetic number, because the mean of its divisors is an integer number (1392846).
Almost surely, 219649052 is an apocalyptic number.
19649052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
19649052 is an abundant number, since it is smaller than the sum of its proper divisors (30493404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19649052 is a wasteful number, since it uses less digits than its factorization.
19649052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5218 (or 5213 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 36.
The square root of 19649052 is about 4432.7251211867. The cubic root of 19649052 is about 269.8446843354.
The spelling of 19649052 in words is "nineteen million, six hundred forty-nine thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •