Base | Representation |
---|---|
bin | 10111011000010101001001… |
… | …10110010000110011001101 |
3 | 20202001002021220100200021201 |
4 | 23230022210312100303031 |
5 | 23214324344200034013 |
6 | 301203014051025501 |
7 | 13554335026152244 |
oct | 1354124466206315 |
9 | 222032256320251 |
10 | 51413524221133 |
11 | 15422398090938 |
12 | 592435129b291 |
13 | 228c3751b4459 |
14 | c9a5dc03b95b |
15 | 5e25b52713dd |
hex | 2ec2a4d90ccd |
51413524221133 has 24 divisors (see below), whose sum is σ = 54965439825120. Its totient is φ = 47955102118560.
The previous prime is 51413524221119. The next prime is 51413524221151. The reversal of 51413524221133 is 33112242531415.
It is not a de Polignac number, because 51413524221133 - 221 = 51413522123981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51413524221092 and 51413524221101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51413524221113) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 39504735 + ... + 40785427.
It is an arithmetic number, because the mean of its divisors is an integer number (2290226659380).
Almost surely, 251413524221133 is an apocalyptic number.
It is an amenable number.
51413524221133 is a deficient number, since it is larger than the sum of its proper divisors (3551915603987).
51413524221133 is a wasteful number, since it uses less digits than its factorization.
51413524221133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1281097 (or 1280970 counting only the distinct ones).
The product of its digits is 86400, while the sum is 37.
Adding to 51413524221133 its reverse (33112242531415), we get a palindrome (84525766752548).
The spelling of 51413524221133 in words is "fifty-one trillion, four hundred thirteen billion, five hundred twenty-four million, two hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •