Base | Representation |
---|---|
bin | 11010110101010010011000… |
… | …101101100111110100100001 |
3 | 120110211202020022112101220202 |
4 | 122311102120231213310201 |
5 | 110431443144340140223 |
6 | 1054553313210114545 |
7 | 33600006443102243 |
oct | 3265223055476441 |
9 | 513752208471822 |
10 | 118011083521313 |
11 | 34669246117aa4 |
12 | 1129b40911ba55 |
13 | 50b05221b4048 |
14 | 211daa45d2093 |
15 | d99b14714428 |
hex | 6b5498b67d21 |
118011083521313 has 4 divisors (see below), whose sum is σ = 118013047519620. Its totient is φ = 118009119523008.
The previous prime is 118011083521277. The next prime is 118011083521333. The reversal of 118011083521313 is 313125380110811.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 112379992489249 + 5631091032064 = 10600943^2 + 2372992^2 .
It is a cyclic number.
It is not a de Polignac number, because 118011083521313 - 216 = 118011083455777 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (118011083521333) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 981909020 + ... + 982029197.
It is an arithmetic number, because the mean of its divisors is an integer number (29503261879905).
Almost surely, 2118011083521313 is an apocalyptic number.
It is an amenable number.
118011083521313 is a deficient number, since it is larger than the sum of its proper divisors (1963998307).
118011083521313 is an equidigital number, since it uses as much as digits as its factorization.
118011083521313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1963998306.
The product of its (nonzero) digits is 17280, while the sum is 38.
The spelling of 118011083521313 in words is "one hundred eighteen trillion, eleven billion, eighty-three million, five hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •