Base | Representation |
---|---|
bin | 1101110001100000010100… |
… | …1101101011000101101111 |
3 | 1222121202200022020121000020 |
4 | 3130120011031223011233 |
5 | 3441110200342444033 |
6 | 52113042312133223 |
7 | 3122061650252640 |
oct | 334300515530557 |
9 | 58552608217006 |
10 | 15144142156143 |
11 | 490965a492960 |
12 | 1847052697213 |
13 | 85b117cb6a30 |
14 | 3a4da229d6c7 |
15 | 1b3e01d3b6b3 |
hex | dc60536b16f |
15144142156143 has 64 divisors (see below), whose sum is σ = 27112358784000. Its totient is φ = 7261613660160.
The previous prime is 15144142156079. The next prime is 15144142156193. The reversal of 15144142156143 is 34165124144151.
It is not a de Polignac number, because 15144142156143 - 26 = 15144142156079 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 15144142156095 and 15144142156104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15144142156193) 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 63 ways as a sum of consecutive naturals, for example, 79331013 + ... + 79521681.
It is an arithmetic number, because the mean of its divisors is an integer number (423630606000).
Almost surely, 215144142156143 is an apocalyptic number.
15144142156143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
15144142156143 is a deficient number, since it is larger than the sum of its proper divisors (11968216627857).
15144142156143 is a wasteful number, since it uses less digits than its factorization.
15144142156143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217152.
The product of its digits is 230400, while the sum is 42.
The spelling of 15144142156143 in words is "fifteen trillion, one hundred forty-four billion, one hundred forty-two million, one hundred fifty-six thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •