Base | Representation |
---|---|
bin | 10011001111010100011… |
… | …111101011011011011101 |
3 | 11200101121211002121102011 |
4 | 103033110133223123131 |
5 | 133130200212042023 |
6 | 2451212404431221 |
7 | 164343236602432 |
oct | 23172437533335 |
9 | 4611554077364 |
10 | 1322120034013 |
11 | 46a787323139 |
12 | 19429b3a8511 |
13 | 978a1a8596c |
14 | 47dc3253b89 |
15 | 245d0d6450d |
hex | 133d47eb6dd |
1322120034013 has 8 divisors (see below), whose sum is σ = 1323527915448. Its totient is φ = 1320712318464.
The previous prime is 1322120033987. The next prime is 1322120034017. The reversal of 1322120034013 is 3104300212231.
It can be written as a sum of positive squares in 4 ways, for example, as 868245649209 + 453874384804 = 931797^2 + 673702^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 1322120034013 - 25 = 1322120033981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1322120034017) 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, 22096545 + ... + 22156297.
It is an arithmetic number, because the mean of its divisors is an integer number (165440989431).
Almost surely, 21322120034013 is an apocalyptic number.
It is an amenable number.
1322120034013 is a deficient number, since it is larger than the sum of its proper divisors (1407881435).
1322120034013 is an equidigital number, since it uses as much as digits as its factorization.
1322120034013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82943.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1322120034013 its reverse (3104300212231), we get a palindrome (4426420246244).
The spelling of 1322120034013 in words is "one trillion, three hundred twenty-two billion, one hundred twenty million, thirty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.246 sec. • engine limits •