Base | Representation |
---|---|
bin | 11011000001101111001101… |
… | …100101101100101011010001 |
3 | 120120212112122112210112222211 |
4 | 123001233031211230223101 |
5 | 111040002414244102101 |
6 | 1100450332143032121 |
7 | 34015555604546635 |
oct | 3301571545545321 |
9 | 516775575715884 |
10 | 118866669128401 |
11 | 3496908696a047 |
12 | 113b91a6b9b641 |
13 | 514310418868c |
14 | 214d26b026dc5 |
15 | db1edc92ac51 |
hex | 6c1bcd96cad1 |
118866669128401 has 8 divisors (see below), whose sum is σ = 125859700255464. Its totient is φ = 111873735125760.
The previous prime is 118866669128393. The next prime is 118866669128407. The reversal of 118866669128401 is 104821966668811.
It can be written as a sum of positive squares in 4 ways, for example, as 203207116225 + 118663462012176 = 450785^2 + 10893276^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 118866669128401 - 23 = 118866669128393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (118866669128407) 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, 21753870 + ... + 26663911.
It is an arithmetic number, because the mean of its divisors is an integer number (15732462531933).
Almost surely, 2118866669128401 is an apocalyptic number.
It is an amenable number.
118866669128401 is a deficient number, since it is larger than the sum of its proper divisors (6993031127063).
118866669128401 is a wasteful number, since it uses less digits than its factorization.
118866669128401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48562211.
The product of its (nonzero) digits is 47775744, while the sum is 67.
The spelling of 118866669128401 in words is "one hundred eighteen trillion, eight hundred sixty-six billion, six hundred sixty-nine million, one hundred twenty-eight thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •