Base | Representation |
---|---|
bin | 1011000010101011011… |
… | …1000101010000000000 |
3 | 200010122100120202020220 |
4 | 2300222313011100000 |
5 | 11102000044043040 |
6 | 223051302503040 |
7 | 16463612236200 |
oct | 2605267052000 |
9 | 603570522226 |
10 | 189697643520 |
11 | 734a5413300 |
12 | 30921434a80 |
13 | 14b71aba458 |
14 | 9277b34400 |
15 | 4e03c8e2d0 |
hex | 2c2adc5400 |
189697643520 has 792 divisors, whose sum is σ = 776163642912. Its totient is φ = 39398768640.
The previous prime is 189697643507. The next prime is 189697643563. The reversal of 189697643520 is 25346796981.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 91068399 + ... + 91070481.
It is a 1-persistent number, because it is pandigital, but 2⋅189697643520 = 379395287040 is not.
Almost surely, 2189697643520 is an apocalyptic number.
189697643520 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 189697643520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (388081821456).
189697643520 is an abundant number, since it is smaller than the sum of its proper divisors (586465999392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
189697643520 is a wasteful number, since it uses less digits than its factorization.
189697643520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2147 (or 2111 counting only the distinct ones).
The product of its (nonzero) digits is 19595520, while the sum is 60.
The spelling of 189697643520 in words is "one hundred eighty-nine billion, six hundred ninety-seven million, six hundred forty-three thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •