Base | Representation |
---|---|
bin | 100101000001… |
… | …0111011101000 |
3 | 1100112011102111 |
4 | 1022002323220 |
5 | 14432120124 |
6 | 1532012104 |
7 | 323662600 |
oct | 112027350 |
9 | 40464374 |
10 | 19410664 |
11 | aa58579 |
12 | 6601034 |
13 | 4038100 |
14 | 2813c00 |
15 | 1a86494 |
hex | 1282ee8 |
19410664 has 72 divisors (see below), whose sum is σ = 46000710. Its totient is φ = 7652736.
The previous prime is 19410661. The next prime is 19410679. The reversal of 19410664 is 46601491.
It can be written as a sum of positive squares in 3 ways, for example, as 14822500 + 4588164 = 3850^2 + 2142^2 .
It is not an unprimeable number, because it can be changed into a prime (19410661) 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 17 ways as a sum of consecutive naturals, for example, 66102 + ... + 66394.
Almost surely, 219410664 is an apocalyptic number.
19410664 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19410664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23000355).
19410664 is an abundant number, since it is smaller than the sum of its proper divisors (26590046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19410664 is a wasteful number, since it uses less digits than its factorization.
19410664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339 (or 315 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 31.
The square root of 19410664 is about 4405.7535110353. The cubic root of 19410664 is about 268.7489631112.
The spelling of 19410664 in words is "nineteen million, four hundred ten thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •