Base | Representation |
---|---|
bin | 101101110100011010101000… |
… | …100011110001100101001111 |
3 | 222102111120010100120110201202 |
4 | 231310122220203301211033 |
5 | 202403101341001403033 |
6 | 1552330145015100115 |
7 | 60305625225144545 |
oct | 5564325043614517 |
9 | 872446110513652 |
10 | 201514103544143 |
11 | 59232718a97145 |
12 | 1a72694967163b |
13 | 8859910599080 |
14 | 37a94983dbd95 |
15 | 1846c9e6c18e8 |
hex | b746a88f194f |
201514103544143 has 16 divisors (see below), whose sum is σ = 222342087693600. Its totient is φ = 181448486469120.
The previous prime is 201514103544137. The next prime is 201514103544211. The reversal of 201514103544143 is 341445301415102.
It is not a de Polignac number, because 201514103544143 - 26 = 201514103544079 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201514103544097 and 201514103544106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201514103544043) 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, 25275953 + ... + 32278506.
It is an arithmetic number, because the mean of its divisors is an integer number (13896380480850).
Almost surely, 2201514103544143 is an apocalyptic number.
201514103544143 is a deficient number, since it is larger than the sum of its proper divisors (20827984149457).
201514103544143 is a wasteful number, since it uses less digits than its factorization.
201514103544143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57561082.
The product of its (nonzero) digits is 115200, while the sum is 38.
Adding to 201514103544143 its reverse (341445301415102), we get a palindrome (542959404959245).
The spelling of 201514103544143 in words is "two hundred one trillion, five hundred fourteen billion, one hundred three million, five hundred forty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •