Base | Representation |
---|---|
bin | 1100000001110101011100… |
… | …1100000001000100000001 |
3 | 1201211100202110220120200201 |
4 | 3000131113030001010001 |
5 | 3213142131232303012 |
6 | 44043442041045201 |
7 | 2533344234150013 |
oct | 300352714010401 |
9 | 51740673816621 |
10 | 13225667072257 |
11 | 4239a792a7202 |
12 | 1597281186801 |
13 | 74c2377916c3 |
14 | 33a1a8cd61b3 |
15 | 17e06b149857 |
hex | c0757301101 |
13225667072257 has 4 divisors (see below), whose sum is σ = 13228547858176. Its totient is φ = 13222786286340.
The previous prime is 13225667072251. The next prime is 13225667072269. The reversal of 13225667072257 is 75227076652231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13225667072257 - 27 = 13225667072129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13225667072198 and 13225667072207.
It is not an unprimeable number, because it can be changed into a prime (13225667072251) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1440386073 + ... + 1440395254.
It is an arithmetic number, because the mean of its divisors is an integer number (3307136964544).
Almost surely, 213225667072257 is an apocalyptic number.
It is an amenable number.
13225667072257 is a deficient number, since it is larger than the sum of its proper divisors (2880785919).
13225667072257 is an equidigital number, since it uses as much as digits as its factorization.
13225667072257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2880785918.
The product of its (nonzero) digits is 14817600, while the sum is 55.
The spelling of 13225667072257 in words is "thirteen trillion, two hundred twenty-five billion, six hundred sixty-seven million, seventy-two thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •