Base | Representation |
---|---|
bin | 11010000011111110011100… |
… | …100000101011100100011111 |
3 | 120000211210111101121000121200 |
4 | 122003332130200223210133 |
5 | 110010433203004303434 |
6 | 1043440451212330543 |
7 | 33100124241551322 |
oct | 3203763440534437 |
9 | 500753441530550 |
10 | 114622418041119 |
11 | 3358210486946a |
12 | 10a32713a73a53 |
13 | 4bc5b03366581 |
14 | 2043a7ca047b9 |
15 | d3b8d36e3199 |
hex | 683f9c82b91f |
114622418041119 has 12 divisors (see below), whose sum is σ = 167084666463000. Its totient is φ = 75713890815504.
The previous prime is 114622418041081. The next prime is 114622418041163. The reversal of 114622418041119 is 911140814226411.
114622418041119 is a `hidden beast` number, since 1 + 1 + 4 + 6 + 224 + 1 + 8 + 0 + 411 + 1 + 9 = 666.
It is not a de Polignac number, because 114622418041119 - 29 = 114622418040607 is a prime.
It is a super-2 number, since 2×1146224180411192 (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 (114622418041199) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 58421211069 + ... + 58421213030.
It is an arithmetic number, because the mean of its divisors is an integer number (13923722205250).
Almost surely, 2114622418041119 is an apocalyptic number.
114622418041119 is a deficient number, since it is larger than the sum of its proper divisors (52462248421881).
114622418041119 is a wasteful number, since it uses less digits than its factorization.
114622418041119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116842424214 (or 116842424211 counting only the distinct ones).
The product of its (nonzero) digits is 110592, while the sum is 45.
The spelling of 114622418041119 in words is "one hundred fourteen trillion, six hundred twenty-two billion, four hundred eighteen million, forty-one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •