Base | Representation |
---|---|
bin | 11010011001110111011100… |
… | …000011011101000100010101 |
3 | 120020011121100222011012212102 |
4 | 122121313130003131010111 |
5 | 110210110012001044330 |
6 | 1050551514021331445 |
7 | 33313610305142642 |
oct | 3231673403350425 |
9 | 506147328135772 |
10 | 116126722674965 |
11 | 34002080594992 |
12 | 11036178566b85 |
13 | 4ca491a5325a2 |
14 | 20967c5c42dc9 |
15 | d65ac8939945 |
hex | 699ddc0dd115 |
116126722674965 has 4 divisors (see below), whose sum is σ = 139352067209964. Its totient is φ = 92901378139968.
The previous prime is 116126722674931. The next prime is 116126722674979. The reversal of 116126722674965 is 569476227621611.
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 37913057540164 + 78213665134801 = 6157358^2 + 8843849^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116126722674965 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11612672267492 + ... + 11612672267501.
It is an arithmetic number, because the mean of its divisors is an integer number (34838016802491).
Almost surely, 2116126722674965 is an apocalyptic number.
It is an amenable number.
116126722674965 is a deficient number, since it is larger than the sum of its proper divisors (23225344534999).
116126722674965 is an equidigital number, since it uses as much as digits as its factorization.
116126722674965 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23225344534998.
The product of its digits is 91445760, while the sum is 65.
The spelling of 116126722674965 in words is "one hundred sixteen trillion, one hundred twenty-six billion, seven hundred twenty-two million, six hundred seventy-four thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.198 sec. • engine limits •