Base | Representation |
---|---|
bin | 1011000000101101100… |
… | …1001000001000000000 |
3 | 200002021120011022011110 |
4 | 2300023121020020000 |
5 | 11044404420303110 |
6 | 222523043043320 |
7 | 16444541616264 |
oct | 2601331101000 |
9 | 602246138143 |
10 | 189169697280 |
11 | 732543a94a3 |
12 | 307b4670540 |
13 | 14ab95cc125 |
14 | 92279860a4 |
15 | 4dc2755a20 |
hex | 2c0b648200 |
189169697280 has 160 divisors (see below), whose sum is σ = 606895781184. Its totient is φ = 50266423296.
The previous prime is 189169697279. The next prime is 189169697291. The reversal of 189169697280 is 82796961981.
It is a tau number, because it is divible by the number of its divisors (160).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2129922 + ... + 2216958.
Almost surely, 2189169697280 is an apocalyptic number.
189169697280 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 189169697280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (303447890592).
189169697280 is an abundant number, since it is smaller than the sum of its proper divisors (417726083904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
189169697280 is an equidigital number, since it uses as much as digits as its factorization.
189169697280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87346 (or 87330 counting only the distinct ones).
The product of its (nonzero) digits is 23514624, while the sum is 66.
The spelling of 189169697280 in words is "one hundred eighty-nine billion, one hundred sixty-nine million, six hundred ninety-seven thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •