Base | Representation |
---|---|
bin | 11001001110101101010… |
… | …11101010000100110000 |
3 | 10001212121001211201201110 |
4 | 30213112223222010300 |
5 | 103200342342221443 |
6 | 1502124401233320 |
7 | 116426230036350 |
oct | 14472653520460 |
9 | 3055531751643 |
10 | 866890195248 |
11 | 304711a084a0 |
12 | 120013932840 |
13 | 6399404526c |
14 | 2dd59d50b60 |
15 | 1783a8be233 |
hex | c9d6aea130 |
866890195248 has 80 divisors (see below), whose sum is σ = 2792061939456. Its totient is φ = 225166283520.
The previous prime is 866890195243. The next prime is 866890195273. The reversal of 866890195248 is 842591098668.
It is a super-2 number, since 2×8668901952482 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is not an unprimeable number, because it can be changed into a prime (866890195243) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 117270411 + ... + 117277802.
Almost surely, 2866890195248 is an apocalyptic number.
866890195248 is a gapful number since it is divisible by the number (88) formed by its first and last digit.
It is an amenable number.
866890195248 is an abundant number, since it is smaller than the sum of its proper divisors (1925171744208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
866890195248 is a wasteful number, since it uses less digits than its factorization.
866890195248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234548242 (or 234548236 counting only the distinct ones).
The product of its (nonzero) digits is 59719680, while the sum is 66.
The spelling of 866890195248 in words is "eight hundred sixty-six billion, eight hundred ninety million, one hundred ninety-five thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •