Base | Representation |
---|---|
bin | 110101010100101111… |
… | …0010010101100110001 |
3 | 101221120120100200111200 |
4 | 1222221132102230301 |
5 | 3334010141040423 |
6 | 124334543001413 |
7 | 11162503452351 |
oct | 1525136225461 |
9 | 357516320450 |
10 | 114512440113 |
11 | 44623318165 |
12 | 1a239b99269 |
13 | aa4c33ab06 |
14 | 578460ab61 |
15 | 2ea3341d43 |
hex | 1aa9792b31 |
114512440113 has 18 divisors (see below), whose sum is σ = 175709019174. Its totient is φ = 71850941184.
The previous prime is 114512440069. The next prime is 114512440151. The reversal of 114512440113 is 311044215411.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 41905365264 + 72607074849 = 204708^2 + 269457^2 .
It is not a de Polignac number, because 114512440113 - 210 = 114512439089 is a prime.
It is a super-2 number, since 2×1145124401132 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (114512440313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 22010556 + ... + 22015757.
Almost surely, 2114512440113 is an apocalyptic number.
It is an amenable number.
114512440113 is a deficient number, since it is larger than the sum of its proper divisors (61196579061).
114512440113 is a wasteful number, since it uses less digits than its factorization.
114512440113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44026353 (or 44026333 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
Adding to 114512440113 its reverse (311044215411), we get a palindrome (425556655524).
The spelling of 114512440113 in words is "one hundred fourteen billion, five hundred twelve million, four hundred forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •