Base | Representation |
---|---|
bin | 11000000110101000011010… |
… | …01010011000011010001101 |
3 | 20221200011122121210210122211 |
4 | 30003110031022120122031 |
5 | 23421411014012201130 |
6 | 304421520230110421 |
7 | 14110304514111352 |
oct | 1403241512303215 |
9 | 227604577723584 |
10 | 53004412225165 |
11 | 15986054973945 |
12 | 5b4073a4ab411 |
13 | 23763aa3a64ab |
14 | d135da4bc629 |
15 | 61db76904a2a |
hex | 30350d29868d |
53004412225165 has 4 divisors (see below), whose sum is σ = 63605294670204. Its totient is φ = 42403529780128.
The previous prime is 53004412225159. The next prime is 53004412225283. The reversal of 53004412225165 is 56152221440035.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13110055049961 + 39894357175204 = 3620781^2 + 6316198^2 .
It is a cyclic number.
It is not a de Polignac number, because 53004412225165 - 29 = 53004412224653 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5300441222512 + ... + 5300441222521.
It is an arithmetic number, because the mean of its divisors is an integer number (15901323667551).
Almost surely, 253004412225165 is an apocalyptic number.
It is an amenable number.
53004412225165 is a deficient number, since it is larger than the sum of its proper divisors (10600882445039).
53004412225165 is a wasteful number, since it uses less digits than its factorization.
53004412225165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10600882445038.
The product of its (nonzero) digits is 288000, while the sum is 40.
The spelling of 53004412225165 in words is "fifty-three trillion, four billion, four hundred twelve million, two hundred twenty-five thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •