Base | Representation |
---|---|
bin | 110001110110111001… |
… | …100111110001001101 |
3 | 12010011220110112001200 |
4 | 301312321213301031 |
5 | 1334114303033031 |
6 | 40332100300113 |
7 | 3603430045212 |
oct | 616671476115 |
9 | 163156415050 |
10 | 53534424141 |
11 | 20781872240 |
12 | a4606a1639 |
13 | 508209cc63 |
14 | 283bccdb09 |
15 | 15d4d018e6 |
hex | c76e67c4d |
53534424141 has 48 divisors (see below), whose sum is σ = 89703469440. Its totient is φ = 30405288960.
The previous prime is 53534424109. The next prime is 53534424191. The reversal of 53534424141 is 14142443535.
53534424141 is a `hidden beast` number, since 5 + 3 + 534 + 42 + 41 + 41 = 666.
It is not a de Polignac number, because 53534424141 - 25 = 53534424109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53534424096 and 53534424105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53534424191) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 323880 + ... + 460398.
It is an arithmetic number, because the mean of its divisors is an integer number (1868822280).
Almost surely, 253534424141 is an apocalyptic number.
53534424141 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
53534424141 is a deficient number, since it is larger than the sum of its proper divisors (36169045299).
53534424141 is a wasteful number, since it uses less digits than its factorization.
53534424141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136786 (or 136783 counting only the distinct ones).
The product of its digits is 115200, while the sum is 36.
Adding to 53534424141 its reverse (14142443535), we get a palindrome (67676867676).
The spelling of 53534424141 in words is "fifty-three billion, five hundred thirty-four million, four hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •