Base | Representation |
---|---|
bin | 1010111011010100100… |
… | …0001110101010111100 |
3 | 122221112200212100200000 |
4 | 2232311020032222330 |
5 | 11033423420131233 |
6 | 222123303034300 |
7 | 16363636205511 |
oct | 2566510165274 |
9 | 587480770600 |
10 | 187722427068 |
11 | 72681463a10 |
12 | 3046ba3b990 |
13 | 1491880c917 |
14 | 912b68b308 |
15 | 4d3a674d13 |
hex | 2bb520eabc |
187722427068 has 144 divisors (see below), whose sum is σ = 545932033920. Its totient is φ = 55921233600.
The previous prime is 187722427007. The next prime is 187722427169. The reversal of 187722427068 is 860724227781.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
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, 482038 + ... + 779618.
It is an arithmetic number, because the mean of its divisors is an integer number (3791194680).
Almost surely, 2187722427068 is an apocalyptic number.
187722427068 is a gapful number since it is divisible by the number (18) 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 187722427068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (272966016960).
187722427068 is an abundant number, since it is smaller than the sum of its proper divisors (358209606852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
187722427068 is a wasteful number, since it uses less digits than its factorization.
187722427068 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 297670 (or 297656 counting only the distinct ones).
The product of its (nonzero) digits is 4214784, while the sum is 54.
The spelling of 187722427068 in words is "one hundred eighty-seven billion, seven hundred twenty-two million, four hundred twenty-seven thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •