Base | Representation |
---|---|
bin | 1010111110110111110… |
… | …1000101000111100100 |
3 | 200001000010211000020112 |
4 | 2233231331011013210 |
5 | 11042402001240133 |
6 | 222402041152152 |
7 | 16426363613120 |
oct | 2575575050744 |
9 | 601003730215 |
10 | 188675805668 |
11 | 73020634409 |
12 | 3069718b658 |
13 | 14a3b1a547c |
14 | 91bc140580 |
15 | 4d941e7648 |
hex | 2bedf451e4 |
188675805668 has 96 divisors (see below), whose sum is σ = 410656490496. Its totient is φ = 74009475072.
The previous prime is 188675805611. The next prime is 188675805701. The reversal of 188675805668 is 866508576881.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (68).
It is a junction number, because it is equal to n+sod(n) for n = 188675805598 and 188675805607.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3485546 + ... + 3539262.
It is an arithmetic number, because the mean of its divisors is an integer number (4277671776).
Almost surely, 2188675805668 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 188675805668, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (205328245248).
188675805668 is an abundant number, since it is smaller than the sum of its proper divisors (221980684828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
188675805668 is a wasteful number, since it uses less digits than its factorization.
188675805668 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53949 (or 53947 counting only the distinct ones).
The product of its (nonzero) digits is 154828800, while the sum is 68.
The spelling of 188675805668 in words is "one hundred eighty-eight billion, six hundred seventy-five million, eight hundred five thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •