Base | Representation |
---|---|
bin | 1100000001100111110101… |
… | …0101111101010100111001 |
3 | 1201211000022202201010122112 |
4 | 3000121331111331110321 |
5 | 3213112140113322210 |
6 | 44042035241302105 |
7 | 2533154534504603 |
oct | 300317525752471 |
9 | 51730282633575 |
10 | 13222012245305 |
11 | 4238473240666 |
12 | 1596621194935 |
13 | 74baa45260c6 |
14 | 339d3d754173 |
15 | 17de05357d05 |
hex | c067d57d539 |
13222012245305 has 8 divisors (see below), whose sum is σ = 15881368908744. Its totient is φ = 10567640320000.
The previous prime is 13222012245301. The next prime is 13222012245473. The reversal of 13222012245305 is 50354221022231.
It can be written as a sum of positive squares in 4 ways, for example, as 551601804601 + 12670410440704 = 742699^2 + 3559552^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13222012245305 - 22 = 13222012245301 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13222012245301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1246178696 + ... + 1246189305.
It is an arithmetic number, because the mean of its divisors is an integer number (1985171113593).
Almost surely, 213222012245305 is an apocalyptic number.
It is an amenable number.
13222012245305 is a deficient number, since it is larger than the sum of its proper divisors (2659356663439).
13222012245305 is a wasteful number, since it uses less digits than its factorization.
13222012245305 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2492369067.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 13222012245305 its reverse (50354221022231), we get a palindrome (63576233267536).
The spelling of 13222012245305 in words is "thirteen trillion, two hundred twenty-two billion, twelve million, two hundred forty-five thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •