Base | Representation |
---|---|
bin | 11010011110110010101100… |
… | …010100011011110100110101 |
3 | 120021100222002201120012202012 |
4 | 122132302230110123310311 |
5 | 110231131234401030331 |
6 | 1051411215124454005 |
7 | 33350222554013351 |
oct | 3236625424336465 |
9 | 507328081505665 |
10 | 116465224236341 |
11 | 341226959260a2 |
12 | 1108b8a7b4a305 |
13 | 4cca814b4a076 |
14 | 20a8d38538461 |
15 | d6e7db29382b |
hex | 69ecac51bd35 |
116465224236341 has 8 divisors (see below), whose sum is σ = 117892227117504. Its totient is φ = 115038788198400.
The previous prime is 116465224236311. The next prime is 116465224236419. The reversal of 116465224236341 is 143632422564611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116465224236341 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116465224236341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116465224236301) 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, 141297356 + ... + 142119221.
It is an arithmetic number, because the mean of its divisors is an integer number (14736528389688).
Almost surely, 2116465224236341 is an apocalyptic number.
It is an amenable number.
116465224236341 is a deficient number, since it is larger than the sum of its proper divisors (1427002881163).
116465224236341 is an equidigital number, since it uses as much as digits as its factorization.
116465224236341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 283421611.
The product of its digits is 4976640, while the sum is 50.
The spelling of 116465224236341 in words is "one hundred sixteen trillion, four hundred sixty-five billion, two hundred twenty-four million, two hundred thirty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •