Base | Representation |
---|---|
bin | 110001011111100100… |
… | …111000011100001011 |
3 | 12002011122010202221111 |
4 | 301133210320130023 |
5 | 1332314114031220 |
6 | 40225201151151 |
7 | 3560635664641 |
oct | 613744703413 |
9 | 162148122844 |
10 | 53143111435 |
11 | 205a09a0207 |
12 | a37162b4b7 |
13 | 501bcb088b |
14 | 2801d4b191 |
15 | 15b07a715a |
hex | c5f93870b |
53143111435 has 12 divisors (see below), whose sum is σ = 67304796048. Its totient is φ = 40276883088.
The previous prime is 53143111391. The next prime is 53143111471. The reversal of 53143111435 is 53411134135.
It is not a de Polignac number, because 53143111435 - 235 = 18783373067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53143111397 and 53143111406.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14719279 + ... + 14722888.
It is an arithmetic number, because the mean of its divisors is an integer number (5608733004).
Almost surely, 253143111435 is an apocalyptic number.
53143111435 is a deficient number, since it is larger than the sum of its proper divisors (14161684613).
53143111435 is a wasteful number, since it uses less digits than its factorization.
53143111435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29442210 (or 29442191 counting only the distinct ones).
The product of its digits is 10800, while the sum is 31.
The spelling of 53143111435 in words is "fifty-three billion, one hundred forty-three million, one hundred eleven thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •