Base | Representation |
---|---|
bin | 11010100010110011001000… |
… | …010010111100100111001101 |
3 | 120022100021211011001020220120 |
4 | 122202303020102330213031 |
5 | 110300134142301442331 |
6 | 1052141513404335153 |
7 | 33406141122166614 |
oct | 3242631022744715 |
9 | 508307734036816 |
10 | 116740571515341 |
11 | 34219442222204 |
12 | 111151312444b9 |
13 | 501a786384ca7 |
14 | 20b83b949287b |
15 | d76a544cc796 |
hex | 6a2cc84bc9cd |
116740571515341 has 16 divisors (see below), whose sum is σ = 155710870732800. Its totient is φ = 77798660939888.
The previous prime is 116740571515307. The next prime is 116740571515391. The reversal of 116740571515341 is 143515175047611.
It is a cyclic number.
It is not a de Polignac number, because 116740571515341 - 210 = 116740571514317 is a prime.
It is a super-2 number, since 2×1167405715153412 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116740571515391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 861619840 + ... + 861755318.
It is an arithmetic number, because the mean of its divisors is an integer number (9731929420800).
Almost surely, 2116740571515341 is an apocalyptic number.
It is an amenable number.
116740571515341 is a deficient number, since it is larger than the sum of its proper divisors (38970299217459).
116740571515341 is a wasteful number, since it uses less digits than its factorization.
116740571515341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238128.
The product of its (nonzero) digits is 1764000, while the sum is 51.
The spelling of 116740571515341 in words is "one hundred sixteen trillion, seven hundred forty billion, five hundred seventy-one million, five hundred fifteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •