Base | Representation |
---|---|
bin | 11000001111110110010101… |
… | …01101111001011110111111 |
3 | 20222210110010212211220020011 |
4 | 30013323022231321132333 |
5 | 23442103131002321421 |
6 | 305223215305004051 |
7 | 14142216120456613 |
oct | 1407731255713677 |
9 | 228713125756204 |
10 | 53321125042111 |
11 | 15a983a9009953 |
12 | 5b91ba8a83627 |
13 | 239a2118674a4 |
14 | d24a83105343 |
15 | 62701145e4e1 |
hex | 307ecab797bf |
53321125042111 has 8 divisors (see below), whose sum is σ = 58278876706944. Its totient is φ = 48565730588160.
The previous prime is 53321125042103. The next prime is 53321125042151. The reversal of 53321125042111 is 11124052112335.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 53321125042111 - 23 = 53321125042103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53321125042151) 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, 50589302170 + ... + 50589303223.
It is an arithmetic number, because the mean of its divisors is an integer number (7284859588368).
Almost surely, 253321125042111 is an apocalyptic number.
53321125042111 is a deficient number, since it is larger than the sum of its proper divisors (4957751664833).
53321125042111 is a wasteful number, since it uses less digits than its factorization.
53321125042111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101178605441.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 53321125042111 its reverse (11124052112335), we get a palindrome (64445177154446).
The spelling of 53321125042111 in words is "fifty-three trillion, three hundred twenty-one billion, one hundred twenty-five million, forty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •