Base | Representation |
---|---|
bin | 100101111101… |
… | …0100111101100 |
3 | 1101110001220200 |
4 | 1023322213230 |
5 | 20043312113 |
6 | 1550313500 |
7 | 331104066 |
oct | 113724754 |
9 | 41401820 |
10 | 19900908 |
11 | 10262935 |
12 | 67b8890 |
13 | 417a2b1 |
14 | 2900736 |
15 | 1b31873 |
hex | 12fa9ec |
19900908 has 72 divisors (see below), whose sum is σ = 52437840. Its totient is φ = 6359040.
The previous prime is 19900901. The next prime is 19900919. The reversal of 19900908 is 80900991.
It is a super-3 number, since 3×199009083 (a number of 23 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (19900901) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 143103 + ... + 143241.
Almost surely, 219900908 is an apocalyptic number.
19900908 is a gapful number since it is divisible by the number (18) 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 19900908, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26218920).
19900908 is an abundant number, since it is smaller than the sum of its proper divisors (32536932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19900908 is a wasteful number, since it uses less digits than its factorization.
19900908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287 (or 282 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 36.
The square root of 19900908 is about 4461.0433757138. The cubic root of 19900908 is about 270.9927241230.
The spelling of 19900908 in words is "nineteen million, nine hundred thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •