Base | Representation |
---|---|
bin | 11010000010100011000001… |
… | …010011100010001101101111 |
3 | 120000111102002222011221001220 |
4 | 122002203001103202031233 |
5 | 110002331131240312421 |
6 | 1043323414210234423 |
7 | 33060050463423642 |
oct | 3202430123421557 |
9 | 500442088157056 |
10 | 114524251104111 |
11 | 3354450a11a762 |
12 | 10a17697b85a13 |
13 | 4bb978a5520b4 |
14 | 203d0091c5a59 |
15 | d3908a3933c6 |
hex | 6828c14e236f |
114524251104111 has 32 divisors (see below), whose sum is σ = 164559001559040. Its totient is φ = 70588607771136.
The previous prime is 114524251104103. The next prime is 114524251104119. The reversal of 114524251104111 is 111401152425411.
It is an interprime number because it is at equal distance from previous prime (114524251104103) and next prime (114524251104119).
It is not a de Polignac number, because 114524251104111 - 23 = 114524251104103 is a prime.
It is a super-2 number, since 2×1145242511041112 (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 (114524251104119) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 71350911 + ... + 72938336.
It is an arithmetic number, because the mean of its divisors is an integer number (5142468798720).
Almost surely, 2114524251104111 is an apocalyptic number.
114524251104111 is a deficient number, since it is larger than the sum of its proper divisors (50034750454929).
114524251104111 is a wasteful number, since it uses less digits than its factorization.
114524251104111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144289543.
The product of its (nonzero) digits is 6400, while the sum is 33.
The spelling of 114524251104111 in words is "one hundred fourteen trillion, five hundred twenty-four billion, two hundred fifty-one million, one hundred four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •