Base | Representation |
---|---|
bin | 1011000001000101110… |
… | …1000110100010011010 |
3 | 200002112122112110201000 |
4 | 2300101131012202122 |
5 | 11100111434341100 |
6 | 222541115005430 |
7 | 16450215243351 |
oct | 2602135064232 |
9 | 602478473630 |
10 | 189271402650 |
11 | 732a6855220 |
12 | 30822739876 |
13 | 14b046bbc15 |
14 | 923729c998 |
15 | 4dcb645900 |
hex | 2c1174689a |
189271402650 has 96 divisors (see below), whose sum is σ = 568961352000. Its totient is φ = 45883972800.
The previous prime is 189271402643. The next prime is 189271402667. The reversal of 189271402650 is 56204172981.
189271402650 is a `hidden beast` number, since 1 + 89 + 271 + 40 + 265 + 0 = 666.
It is a super-2 number, since 2×1892714026502 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 189271402596 and 189271402605.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6357925 + ... + 6387624.
It is an arithmetic number, because the mean of its divisors is an integer number (5926680750).
Almost surely, 2189271402650 is an apocalyptic number.
189271402650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
189271402650 is an abundant number, since it is smaller than the sum of its proper divisors (379689949350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
189271402650 is a wasteful number, since it uses less digits than its factorization.
189271402650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12745581 (or 12745570 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 45.
The spelling of 189271402650 in words is "one hundred eighty-nine billion, two hundred seventy-one million, four hundred two thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •