Base | Representation |
---|---|
bin | 1100101111110001111111… |
… | …1001110000100001101001 |
3 | 1211121211012101111212110212 |
4 | 3023330133321300201221 |
5 | 3314110221430142023 |
6 | 45450224110550505 |
7 | 2644360046234234 |
oct | 313743771604151 |
9 | 54554171455425 |
10 | 14015013521513 |
11 | 4513808842604 |
12 | 16a4253808435 |
13 | 7a87c15256a4 |
14 | 36648a3b241b |
15 | 194868ed3e78 |
hex | cbf1fe70869 |
14015013521513 has 16 divisors (see below), whose sum is σ = 14854229579520. Its totient is φ = 13177447186176.
The previous prime is 14015013521503. The next prime is 14015013521527. The reversal of 14015013521513 is 31512531051041.
It is not a de Polignac number, because 14015013521513 - 230 = 14013939779689 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14015013521513.
It is not an unprimeable number, because it can be changed into a prime (14015013521503) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 95102795 + ... + 95250047.
It is an arithmetic number, because the mean of its divisors is an integer number (928389348720).
Almost surely, 214015013521513 is an apocalyptic number.
It is an amenable number.
14015013521513 is a deficient number, since it is larger than the sum of its proper divisors (839216058007).
14015013521513 is a wasteful number, since it uses less digits than its factorization.
14015013521513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152816.
The product of its (nonzero) digits is 9000, while the sum is 32.
Adding to 14015013521513 its reverse (31512531051041), we get a palindrome (45527544572554).
The spelling of 14015013521513 in words is "fourteen trillion, fifteen billion, thirteen million, five hundred twenty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •