Base | Representation |
---|---|
bin | 1010110010111101100101… |
… | …1100010100010010111000 |
3 | 1120000211012111112022100120 |
4 | 2230233121130110102320 |
5 | 3023442034013433010 |
6 | 41125144210333240 |
7 | 2333424410162142 |
oct | 254573134242270 |
9 | 46024174468316 |
10 | 11870642717880 |
11 | 3867347390181 |
12 | 13b873a28a220 |
13 | 681520a1c5bb |
14 | 2d0783a19c92 |
15 | 158bb1716e70 |
hex | acbd97144b8 |
11870642717880 has 32 divisors (see below), whose sum is σ = 35611928154000. Its totient is φ = 3165504724736.
The previous prime is 11870642717849. The next prime is 11870642717881. The reversal of 11870642717880 is 8871724607811.
11870642717880 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11870642717881) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49461011205 + ... + 49461011444.
Almost surely, 211870642717880 is an apocalyptic number.
11870642717880 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11870642717880 is an abundant number, since it is smaller than the sum of its proper divisors (23741285436120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11870642717880 is a wasteful number, since it uses less digits than its factorization.
11870642717880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98922022663 (or 98922022659 counting only the distinct ones).
The product of its (nonzero) digits is 8429568, while the sum is 60.
The spelling of 11870642717880 in words is "eleven trillion, eight hundred seventy billion, six hundred forty-two million, seven hundred seventeen thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •