Base | Representation |
---|---|
bin | 100110100101110111111… |
… | …0010001000110010101101 |
3 | 200210001120202100100202200 |
4 | 1031023233302020302231 |
5 | 1143400104202303401 |
6 | 15140344004212113 |
7 | 1055126242503201 |
oct | 115135762106255 |
9 | 20701522310680 |
10 | 5304012541101 |
11 | 176546789332a |
12 | 717b5309a039 |
13 | 2c62212b5941 |
14 | 144a03784b01 |
15 | 92e822d1686 |
hex | 4d2efc88cad |
5304012541101 has 12 divisors (see below), whose sum is σ = 7661418385920. Its totient is φ = 3535977466440.
The previous prime is 5304012541073. The next prime is 5304012541103. The reversal of 5304012541101 is 1011452104035.
5304012541101 is a `hidden beast` number, since 5 + 3 + 0 + 4 + 0 + 12 + 541 + 101 = 666.
It is not a de Polignac number, because 5304012541101 - 213 = 5304012532909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5304012541103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1461895 + ... + 3570036.
It is an arithmetic number, because the mean of its divisors is an integer number (638451532160).
Almost surely, 25304012541101 is an apocalyptic number.
It is an amenable number.
5304012541101 is a deficient number, since it is larger than the sum of its proper divisors (2357405844819).
5304012541101 is a wasteful number, since it uses less digits than its factorization.
5304012541101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5149056 (or 5149053 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 5304012541101 its reverse (1011452104035), we get a palindrome (6315464645136).
The spelling of 5304012541101 in words is "five trillion, three hundred four billion, twelve million, five hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •