Base | Representation |
---|---|
bin | 11001111111111010101101… |
… | …001101011110000010110011 |
3 | 112222212010121212210001022022 |
4 | 121333322231031132002303 |
5 | 104441401014441442121 |
6 | 1043104405042102055 |
7 | 33041022103001300 |
oct | 3177725515360263 |
9 | 488763555701268 |
10 | 114343525343411 |
11 | 334848a9143851 |
12 | 109a865b34a92b |
13 | 4ba571844bc60 |
14 | 2034382c680a7 |
15 | d3450e0c9aab |
hex | 67fead35e0b3 |
114343525343411 has 96 divisors (see below), whose sum is σ = 153201285135360. Its totient is φ = 84288314880000.
The previous prime is 114343525343393. The next prime is 114343525343413.
114343525343411 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 114343525343411 - 238 = 114068647436467 is a prime.
It is a super-2 number, since 2×1143435253434112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (114343525343413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 10829005550 + ... + 10829016108.
It is an arithmetic number, because the mean of its divisors is an integer number (1595846720160).
Almost surely, 2114343525343411 is an apocalyptic number.
114343525343411 is a deficient number, since it is larger than the sum of its proper divisors (38857759791949).
114343525343411 is a wasteful number, since it uses less digits than its factorization.
114343525343411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20605 (or 20598 counting only the distinct ones).
The product of its digits is 1036800, while the sum is 44.
The spelling of 114343525343411 in words is "one hundred fourteen trillion, three hundred forty-three billion, five hundred twenty-five million, three hundred forty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •