Base | Representation |
---|---|
bin | 1010111111011111000… |
… | …0001011011101111100 |
3 | 200001102121010220100000 |
4 | 2233313300023131330 |
5 | 11043221042232324 |
6 | 222430232434300 |
7 | 16433431116120 |
oct | 2576760133574 |
9 | 601377126300 |
10 | 188840195964 |
11 | 730a5405262 |
12 | 30722248990 |
13 | 14a66272334 |
14 | 91d5cd3580 |
15 | 4da386a9c9 |
hex | 2bf7c0b77c |
188840195964 has 72 divisors (see below), whose sum is σ = 565743488128. Its totient is φ = 53954339760.
The previous prime is 188840195953. The next prime is 188840195989. The reversal of 188840195964 is 469591048881.
188840195964 is a `hidden beast` number, since 1 + 8 + 88 + 401 + 95 + 9 + 64 = 666.
It is a super-2 number, since 2×1888401959642 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13870342 + ... + 13883949.
Almost surely, 2188840195964 is an apocalyptic number.
188840195964 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
188840195964 is an abundant number, since it is smaller than the sum of its proper divisors (376903292164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
188840195964 is a wasteful number, since it uses less digits than its factorization.
188840195964 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27754317 (or 27754303 counting only the distinct ones).
The product of its (nonzero) digits is 19906560, while the sum is 63.
The spelling of 188840195964 in words is "one hundred eighty-eight billion, eight hundred forty million, one hundred ninety-five thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •