Base | Representation |
---|---|
bin | 1100110010000111011010… |
… | …1101000101100001111111 |
3 | 1211202122201210102212120112 |
4 | 3030201312231011201333 |
5 | 3320234343334220020 |
6 | 45520500212540235 |
7 | 2650310042151023 |
oct | 314416655054177 |
9 | 54678653385515 |
10 | 14055124523135 |
11 | 4529821416823 |
12 | 16abb8892167b |
13 | 7ac5145a1187 |
14 | 3683b35d6383 |
15 | 1959155e52c5 |
hex | cc876b4587f |
14055124523135 has 64 divisors (see below), whose sum is σ = 17967059193600. Its totient is φ = 10534844178432.
The previous prime is 14055124523131. The next prime is 14055124523137. The reversal of 14055124523135 is 53132542155041.
It is not a de Polignac number, because 14055124523135 - 22 = 14055124523131 is a prime.
It is a super-2 number, since 2×140551245231352 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14055124523092 and 14055124523101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14055124523131) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5309830382 + ... + 5309833028.
It is an arithmetic number, because the mean of its divisors is an integer number (280735299900).
Almost surely, 214055124523135 is an apocalyptic number.
14055124523135 is a deficient number, since it is larger than the sum of its proper divisors (3911934670465).
14055124523135 is a wasteful number, since it uses less digits than its factorization.
14055124523135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4980.
The product of its (nonzero) digits is 360000, while the sum is 41.
Adding to 14055124523135 its reverse (53132542155041), we get a palindrome (67187666678176).
The spelling of 14055124523135 in words is "fourteen trillion, fifty-five billion, one hundred twenty-four million, five hundred twenty-three thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •