Base | Representation |
---|---|
bin | 1100000001001101111101… |
… | …0000111010100111100001 |
3 | 1201210100101121112102210001 |
4 | 3000103133100322213201 |
5 | 3213003423134443230 |
6 | 44034530033140001 |
7 | 2532520430305243 |
oct | 300233720724741 |
9 | 51710347472701 |
10 | 13215065156065 |
11 | 42355288456a3 |
12 | 15952026ba601 |
13 | 74b238187406 |
14 | 339880c4c093 |
15 | 17db4a4e10ca |
hex | c04df43a9e1 |
13215065156065 has 8 divisors (see below), whose sum is σ = 15873983988840. Its totient is φ = 10561448257152.
The previous prime is 13215065156039. The next prime is 13215065156077. The reversal of 13215065156065 is 56065156051231.
It can be written as a sum of positive squares in 4 ways, for example, as 335091634641 + 12879973521424 = 578871^2 + 3588868^2 .
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 13215065156065 - 27 = 13215065155937 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1325477980 + ... + 1325487949.
It is an arithmetic number, because the mean of its divisors is an integer number (1984247998605).
Almost surely, 213215065156065 is an apocalyptic number.
It is an amenable number.
13215065156065 is a deficient number, since it is larger than the sum of its proper divisors (2658918832775).
13215065156065 is an equidigital number, since it uses as much as digits as its factorization.
13215065156065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2650966931.
The product of its (nonzero) digits is 810000, while the sum is 46.
The spelling of 13215065156065 in words is "thirteen trillion, two hundred fifteen billion, sixty-five million, one hundred fifty-six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •