Base | Representation |
---|---|
bin | 11010000010010111110011… |
… | …001101010110011101011011 |
3 | 120000110021000100101021121111 |
4 | 122002113303031112131123 |
5 | 110002131443040121021 |
6 | 1043314102515121151 |
7 | 33056143103120434 |
oct | 3202276315263533 |
9 | 500407010337544 |
10 | 114512203442011 |
11 | 3353a397574921 |
12 | 10a152952a31b7 |
13 | 4bb85ba57035b |
14 | 203c5c511c48b |
15 | d38ad285a8e1 |
hex | 6825f335675b |
114512203442011 has 4 divisors (see below), whose sum is σ = 114512225294152. Its totient is φ = 114512181589872.
The previous prime is 114512203441963. The next prime is 114512203442029. The reversal of 114512203442011 is 110244302215411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 114512203442011 - 221 = 114512201344859 is a prime.
It is a super-2 number, since 2×1145122034420112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114512203842011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2153911 + ... + 15286063.
It is an arithmetic number, because the mean of its divisors is an integer number (28628056323538).
Almost surely, 2114512203442011 is an apocalyptic number.
114512203442011 is a deficient number, since it is larger than the sum of its proper divisors (21852141).
114512203442011 is an equidigital number, since it uses as much as digits as its factorization.
114512203442011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21852140.
The product of its (nonzero) digits is 7680, while the sum is 31.
Adding to 114512203442011 its reverse (110244302215411), we get a palindrome (224756505657422).
The spelling of 114512203442011 in words is "one hundred fourteen trillion, five hundred twelve billion, two hundred three million, four hundred forty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •