Base | Representation |
---|---|
bin | 1101001101110101001010… |
… | …0011101011101011111111 |
3 | 1220110011201110022011022201 |
4 | 3103131102203223223333 |
5 | 3401040004404314223 |
6 | 50523322440452331 |
7 | 3026564104222141 |
oct | 323352243535377 |
9 | 56404643264281 |
10 | 14531259448063 |
11 | 46a2744147086 |
12 | 176830947a0a7 |
13 | 8153a4373c47 |
14 | 3834610a2c91 |
15 | 1a2ed0ed9ead |
hex | d37528ebaff |
14531259448063 has 4 divisors (see below), whose sum is σ = 14531366448040. Its totient is φ = 14531152448088.
The previous prime is 14531259448009. The next prime is 14531259448073. The reversal of 14531259448063 is 36084495213541.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14531259448063 is a prime.
It is a super-2 number, since 2×145312594480632 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14531259447995 and 14531259448013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14531259448073) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53296020 + ... + 53567977.
It is an arithmetic number, because the mean of its divisors is an integer number (3632841612010).
Almost surely, 214531259448063 is an apocalyptic number.
14531259448063 is a deficient number, since it is larger than the sum of its proper divisors (106999977).
14531259448063 is a wasteful number, since it uses less digits than its factorization.
14531259448063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106999976.
The product of its (nonzero) digits is 12441600, while the sum is 55.
The spelling of 14531259448063 in words is "fourteen trillion, five hundred thirty-one billion, two hundred fifty-nine million, four hundred forty-eight thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •