Base | Representation |
---|---|
bin | 1011001010000111010… |
… | …1011001100001100000 |
3 | 200022210110111110121110 |
4 | 2302201311121201200 |
5 | 11120042041102401 |
6 | 224021325023320 |
7 | 16564230326424 |
oct | 2624165314140 |
9 | 608713443543 |
10 | 191693690976 |
11 | 7432a1002a7 |
12 | 311999b4b40 |
13 | 150cc4ac718 |
14 | 93c6c80b84 |
15 | 4ebe1209d6 |
hex | 2ca1d59860 |
191693690976 has 24 divisors (see below), whose sum is σ = 503195939064. Its totient is φ = 63897896960.
The previous prime is 191693690953. The next prime is 191693690977. The reversal of 191693690976 is 679096396191.
It is a tau number, because it is divible by the number of its divisors (24).
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (191693690977) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 998404545 + ... + 998404736.
It is an arithmetic number, because the mean of its divisors is an integer number (20966497461).
Almost surely, 2191693690976 is an apocalyptic number.
191693690976 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
191693690976 is an abundant number, since it is smaller than the sum of its proper divisors (311502248088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
191693690976 is a wasteful number, since it uses less digits than its factorization.
191693690976 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1996809294 (or 1996809286 counting only the distinct ones).
The product of its (nonzero) digits is 29760696, while the sum is 66.
The spelling of 191693690976 in words is "one hundred ninety-one billion, six hundred ninety-three million, six hundred ninety thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •