Base | Representation |
---|---|
bin | 10011001111010011100… |
… | …000001110101001000101 |
3 | 11200101120122210120020201 |
4 | 103033103200032221011 |
5 | 133130131432313104 |
6 | 2451211012130501 |
7 | 164342645325655 |
oct | 23172340165105 |
9 | 4611518716221 |
10 | 1322103401029 |
11 | 46a7789a2574 |
12 | 194295906a31 |
13 | 9789b4b0c68 |
14 | 47dc0d64365 |
15 | 245ce67b0a4 |
hex | 133d380ea45 |
1322103401029 has 2 divisors, whose sum is σ = 1322103401030. Its totient is φ = 1322103401028.
The previous prime is 1322103401023. The next prime is 1322103401053. The reversal of 1322103401029 is 9201043012231.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1072001390625 + 250102010404 = 1035375^2 + 500102^2 .
It is a cyclic number.
It is not a de Polignac number, because 1322103401029 - 25 = 1322103400997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1322103400988 and 1322103401006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1322103401023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 661051700514 + 661051700515.
It is an arithmetic number, because the mean of its divisors is an integer number (661051700515).
Almost surely, 21322103401029 is an apocalyptic number.
It is an amenable number.
1322103401029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1322103401029 is an equidigital number, since it uses as much as digits as its factorization.
1322103401029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 1322103401029 in words is "one trillion, three hundred twenty-two billion, one hundred three million, four hundred one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •