Base | Representation |
---|---|
bin | 11001111110011100001010… |
… | …100011111111001000101001 |
3 | 112222111102121021002202022002 |
4 | 121332130022203333020221 |
5 | 104433220120122441410 |
6 | 1042550020025340345 |
7 | 33030466364321636 |
oct | 3176341243771051 |
9 | 488442537082262 |
10 | 114242012312105 |
11 | 33445846737957 |
12 | 10990a4a9376b5 |
13 | 4b98c8b336a22 |
14 | 202d4b2cb118d |
15 | d31a6c11e7a5 |
hex | 67e70a8ff229 |
114242012312105 has 4 divisors (see below), whose sum is σ = 137090414774532. Its totient is φ = 91393609849680.
The previous prime is 114242012312027. The next prime is 114242012312149. The reversal of 114242012312105 is 501213210242411.
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 60369465708841 + 53872546603264 = 7769779^2 + 7339792^2 .
It is not a de Polignac number, because 114242012312105 - 210 = 114242012311081 is a prime.
It is a Duffinian number.
It is a Curzon 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, 11424201231206 + ... + 11424201231215.
It is an arithmetic number, because the mean of its divisors is an integer number (34272603693633).
Almost surely, 2114242012312105 is an apocalyptic number.
It is an amenable number.
114242012312105 is a deficient number, since it is larger than the sum of its proper divisors (22848402462427).
114242012312105 is an equidigital number, since it uses as much as digits as its factorization.
114242012312105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22848402462426.
The product of its (nonzero) digits is 3840, while the sum is 29.
Adding to 114242012312105 its reverse (501213210242411), we get a palindrome (615455222554516).
The spelling of 114242012312105 in words is "one hundred fourteen trillion, two hundred forty-two billion, twelve million, three hundred twelve thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •