Base | Representation |
---|---|
bin | 11010000010010110111010… |
… | …000101001111010111110000 |
3 | 120000110011112112221010020201 |
4 | 122002112322011033113300 |
5 | 110002123012210431022 |
6 | 1043313423440444544 |
7 | 33056110254454243 |
oct | 3202267205172760 |
9 | 500404475833221 |
10 | 114511245014512 |
11 | 33539a45566085 |
12 | 10a15068319754 |
13 | 4bb8496b2a6a8 |
14 | 203c533b1325a |
15 | d38a7863c127 |
hex | 6825ba14f5f0 |
114511245014512 has 80 divisors (see below), whose sum is σ = 225808236276480. Its totient is φ = 56239737854976.
The previous prime is 114511245014501. The next prime is 114511245014519. The reversal of 114511245014512 is 215410542115411.
It is a super-2 number, since 2×1145112450145122 (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 (114511245014519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9100466173 + ... + 9100478755.
It is an arithmetic number, because the mean of its divisors is an integer number (2822602953456).
Almost surely, 2114511245014512 is an apocalyptic number.
It is an amenable number.
114511245014512 is a deficient number, since it is larger than the sum of its proper divisors (111296991261968).
114511245014512 is a wasteful number, since it uses less digits than its factorization.
114511245014512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19670 (or 19664 counting only the distinct ones).
The product of its (nonzero) digits is 32000, while the sum is 37.
Adding to 114511245014512 its reverse (215410542115411), we get a palindrome (329921787129923).
The spelling of 114511245014512 in words is "one hundred fourteen trillion, five hundred eleven billion, two hundred forty-five million, fourteen thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •