Base | Representation |
---|---|
bin | 1100000001010100001111… |
… | …1110010100010000001001 |
3 | 1201210111202100212011220122 |
4 | 3000111003332110100021 |
5 | 3213020403210413040 |
6 | 44035405431433025 |
7 | 2532610335001121 |
oct | 300250376242011 |
9 | 51714670764818 |
10 | 13216754779145 |
11 | 4236215570505 |
12 | 15955b4525775 |
13 | 74b44723c698 |
14 | 3399a13d1c81 |
15 | 17dbe89e51b5 |
hex | c0543f94409 |
13216754779145 has 8 divisors (see below), whose sum is σ = 15860380967304. Its totient is φ = 10573220335104.
The previous prime is 13216754779133. The next prime is 13216754779201. The reversal of 13216754779145 is 54197745761231.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1472446341136 + 11744308438009 = 1213444^2 + 3426997^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 13216754779145 - 228 = 13216486343689 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22618694 + ... + 23195663.
It is an arithmetic number, because the mean of its divisors is an integer number (1982547620913).
Almost surely, 213216754779145 is an apocalyptic number.
It is an amenable number.
13216754779145 is a deficient number, since it is larger than the sum of its proper divisors (2643626188159).
13216754779145 is an equidigital number, since it uses as much as digits as its factorization.
13216754779145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45872059.
The product of its digits is 44452800, while the sum is 62.
The spelling of 13216754779145 in words is "thirteen trillion, two hundred sixteen billion, seven hundred fifty-four million, seven hundred seventy-nine thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.041 sec. • engine limits •