Base | Representation |
---|---|
bin | 1011001001001101001… |
… | …0011110110011101000 |
3 | 200022011110022020022110 |
4 | 2302103102132303220 |
5 | 11114042103002202 |
6 | 223541210322320 |
7 | 16555205142000 |
oct | 2622322366350 |
9 | 608143266273 |
10 | 191449656552 |
11 | 74214381660 |
12 | 311301293a0 |
13 | 15090a7845b |
14 | 93a26b9000 |
15 | 4ea79b926c |
hex | 2c9349ece8 |
191449656552 has 128 divisors (see below), whose sum is σ = 608904576000. Its totient is φ = 49727160000.
The previous prime is 191449656539. The next prime is 191449656569. The reversal of 191449656552 is 255656944191.
191449656552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 191449656492 and 191449656501.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 966574 + ... + 1147677.
It is an arithmetic number, because the mean of its divisors is an integer number (4757067000).
Almost surely, 2191449656552 is an apocalyptic number.
191449656552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
191449656552 is an abundant number, since it is smaller than the sum of its proper divisors (417454919448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
191449656552 is a wasteful number, since it uses less digits than its factorization.
191449656552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2114292 (or 2114274 counting only the distinct ones).
The product of its digits is 11664000, while the sum is 57.
The spelling of 191449656552 in words is "one hundred ninety-one billion, four hundred forty-nine million, six hundred fifty-six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •