Base | Representation |
---|---|
bin | 11000010101101001010111… |
… | …01111001001011111110011 |
3 | 21000111111022012122222122210 |
4 | 30022310223233021133303 |
5 | 24003334104220133121 |
6 | 305454521323103203 |
7 | 14162500311366303 |
oct | 1412645357113763 |
9 | 230444265588583 |
10 | 53520321255411 |
11 | 1606492809321a |
12 | 600471b371b03 |
13 | 23b2c384a901a |
14 | d3057c553603 |
15 | 62c2be05e876 |
hex | 30ad2bbc97f3 |
53520321255411 has 8 divisors (see below), whose sum is σ = 73662377641984. Its totient is φ = 34529239519560.
The previous prime is 53520321255403. The next prime is 53520321255451. The reversal of 53520321255411 is 11455212302535.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53520321255411 - 23 = 53520321255403 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 53520321255411.
It is not an unprimeable number, because it can be changed into a prime (53520321255451) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 287743662571 + ... + 287743662756.
It is an arithmetic number, because the mean of its divisors is an integer number (9207797205248).
Almost surely, 253520321255411 is an apocalyptic number.
53520321255411 is a deficient number, since it is larger than the sum of its proper divisors (20142056386573).
53520321255411 is a wasteful number, since it uses less digits than its factorization.
53520321255411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 575487325361.
The product of its (nonzero) digits is 180000, while the sum is 39.
Adding to 53520321255411 its reverse (11455212302535), we get a palindrome (64975533557946).
The spelling of 53520321255411 in words is "fifty-three trillion, five hundred twenty billion, three hundred twenty-one million, two hundred fifty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •