Base | Representation |
---|---|
bin | 10010011000101000… |
… | …101100000000000000 |
3 | 1212221202120001010000 |
4 | 102120220230000000 |
5 | 310412103001000 |
6 | 13022503040000 |
7 | 1266122641410 |
oct | 223050540000 |
9 | 55852501100 |
10 | 19740672000 |
11 | 8410105065 |
12 | 39ab140000 |
13 | 1b27a4a50a |
14 | d53a9c640 |
15 | 7a80e3000 |
hex | 498a2c000 |
19740672000 has 1200 divisors, whose sum is σ = 89065424448. Its totient is φ = 4246732800.
The previous prime is 19740671987. The next prime is 19740672011. The reversal of 19740672000 is 27604791.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (1200).
It is a super-3 number, since 3×197406720003 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 1161215992 + ... + 1161216008.
Almost surely, 219740672000 is an apocalyptic number.
19740672000 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 19740672000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44532712224).
19740672000 is an abundant number, since it is smaller than the sum of its proper divisors (69324752448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19740672000 is an frugal number, since it uses more digits than its factorization.
19740672000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79 (or 34 counting only the distinct ones).
The product of its (nonzero) digits is 21168, while the sum is 36.
The spelling of 19740672000 in words is "nineteen billion, seven hundred forty million, six hundred seventy-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •