Base | Representation |
---|---|
bin | 10010000100001000… |
… | …001111001000000000 |
3 | 1212001210011102120222 |
4 | 102010020033020000 |
5 | 304211013331200 |
6 | 12524412522212 |
7 | 1254444361604 |
oct | 220410171000 |
9 | 55053142528 |
10 | 19396620800 |
11 | 8253983327 |
12 | 3913a80368 |
13 | 1aa1697c1b |
14 | d200dd504 |
15 | 787cd1d85 |
hex | 48420f200 |
19396620800 has 90 divisors (see below), whose sum is σ = 48095713809. Its totient is φ = 7752345600.
The previous prime is 19396620791. The next prime is 19396620823. The reversal of 19396620800 is 802669391.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 19008688384 + 387932416 = 137872^2 + 19696^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=98480.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 15756185 + ... + 15757415.
Almost surely, 219396620800 is an apocalyptic number.
19396620800 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 19396620800
19396620800 is an abundant number, since it is smaller than the sum of its proper divisors (28699093009).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19396620800 is an frugal number, since it uses more digits than its factorization.
19396620800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2490 (or 1238 counting only the distinct ones).
The product of its (nonzero) digits is 139968, while the sum is 44.
The spelling of 19396620800 in words is "nineteen billion, three hundred ninety-six million, six hundred twenty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •