Base | Representation |
---|---|
bin | 10010010001000101… |
… | …011011110001110000 |
3 | 1212121221011221002002 |
4 | 102101011123301300 |
5 | 310132140140000 |
6 | 13002135513132 |
7 | 1263024110213 |
oct | 222105336160 |
9 | 55557157062 |
10 | 19613990000 |
11 | 8355649aa0 |
12 | 39748287a8 |
13 | 1b07724057 |
14 | d40d2377a |
15 | 79be1c8d5 |
hex | 49115bc70 |
19613990000 has 200 divisors, whose sum is σ = 53080196400. Its totient is φ = 6956800000.
The previous prime is 19613989991. The next prime is 19613990003. The reversal of 19613990000 is 9931691.
It is a tau number, because it is divible by the number of its divisors (200).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19613990003) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 4507826 + ... + 4512174.
It is an arithmetic number, because the mean of its divisors is an integer number (265400982).
Almost surely, 219613990000 is an apocalyptic number.
19613990000 is a gapful number since it is divisible by the number (10) 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 19613990000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26540098200).
19613990000 is an abundant number, since it is smaller than the sum of its proper divisors (33466206400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19613990000 is a wasteful number, since it uses less digits than its factorization.
19613990000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4429 (or 4408 counting only the distinct ones).
The product of its (nonzero) digits is 13122, while the sum is 38.
The spelling of 19613990000 in words is "nineteen billion, six hundred thirteen million, nine hundred ninety thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •