Base | Representation |
---|---|
bin | 11000010101011010011011… |
… | …11011110001010110000111 |
3 | 21000110201121112202211010101 |
4 | 30022231031323301112013 |
5 | 24003221200043230421 |
6 | 305451114044104531 |
7 | 14162064542664040 |
oct | 1412551573612607 |
9 | 230421545684111 |
10 | 53512305055111 |
11 | 160614941602a1 |
12 | 6003062835147 |
13 | 23b225b7b3136 |
14 | d3001ba6d8c7 |
15 | 62bea0414191 |
hex | 30ab4def1587 |
53512305055111 has 16 divisors (see below), whose sum is σ = 63010480208704. Its totient is φ = 44485441138944.
The previous prime is 53512305055057. The next prime is 53512305055141. The reversal of 53512305055111 is 11155050321535.
It is a cyclic number.
It is not a de Polignac number, because 53512305055111 - 223 = 53512296666503 is a prime.
It is a super-2 number, since 2×535123050551112 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53512305055141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 329968800 + ... + 330130933.
It is an arithmetic number, because the mean of its divisors is an integer number (3938155013044).
Almost surely, 253512305055111 is an apocalyptic number.
53512305055111 is a deficient number, since it is larger than the sum of its proper divisors (9498175153593).
53512305055111 is a wasteful number, since it uses less digits than its factorization.
53512305055111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 660100090.
The product of its (nonzero) digits is 56250, while the sum is 37.
Adding to 53512305055111 its reverse (11155050321535), we get a palindrome (64667355376646).
The spelling of 53512305055111 in words is "fifty-three trillion, five hundred twelve billion, three hundred five million, fifty-five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •