Base | Representation |
---|---|
bin | 11101100101010010101100… |
… | …01110001001011100101001 |
3 | 22112100000012220021102011210 |
4 | 32302221112032021130221 |
5 | 32011312041412331010 |
6 | 350204540111343333 |
7 | 16462632336534102 |
oct | 1662512616113451 |
9 | 275300186242153 |
10 | 65053021214505 |
11 | 19800916601905 |
12 | 7367865221b49 |
13 | 2a3b6205b3b5c |
14 | 120c823b793a9 |
15 | 77c2a1eedb20 |
hex | 3b2a56389729 |
65053021214505 has 16 divisors (see below), whose sum is σ = 104087708734464. Its totient is φ = 34693986384000.
The previous prime is 65053021214501. The next prime is 65053021214551. The reversal of 65053021214505 is 50541212035056.
65053021214505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 65053021214505 - 22 = 65053021214501 is a prime.
It is not an unprimeable number, because it can be changed into a prime (65053021214501) 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 15 ways as a sum of consecutive naturals, for example, 59330121 + ... + 60416630.
It is an arithmetic number, because the mean of its divisors is an integer number (6505481795904).
Almost surely, 265053021214505 is an apocalyptic number.
It is an amenable number.
65053021214505 is a deficient number, since it is larger than the sum of its proper divisors (39034687519959).
65053021214505 is a wasteful number, since it uses less digits than its factorization.
65053021214505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119782976.
The product of its (nonzero) digits is 180000, while the sum is 39.
The spelling of 65053021214505 in words is "sixty-five trillion, fifty-three billion, twenty-one million, two hundred fourteen thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •