Base | Representation |
---|---|
bin | 10011001111001110101… |
… | …010001101000101101111 |
3 | 11200101100222212120101202 |
4 | 103033032222031011233 |
5 | 133130000131130111 |
6 | 2451154550200115 |
7 | 164340640460201 |
oct | 23171652150557 |
9 | 4611328776352 |
10 | 1322022130031 |
11 | 46a737033459 |
12 | 19427265303b |
13 | 978876c7205 |
14 | 47db424a771 |
15 | 245c7475b3b |
hex | 133cea8d16f |
1322022130031 has 2 divisors, whose sum is σ = 1322022130032. Its totient is φ = 1322022130030.
The previous prime is 1322022130003. The next prime is 1322022130063. The reversal of 1322022130031 is 1300312202231.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1322022130031 is a prime.
It is a super-2 number, since 2×13220221300312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1322022129985 and 1322022130012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1322022100031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 661011065015 + 661011065016.
It is an arithmetic number, because the mean of its divisors is an integer number (661011065016).
Almost surely, 21322022130031 is an apocalyptic number.
1322022130031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1322022130031 is an equidigital number, since it uses as much as digits as its factorization.
1322022130031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1322022130031 its reverse (1300312202231), we get a palindrome (2622334332262).
The spelling of 1322022130031 in words is "one trillion, three hundred twenty-two billion, twenty-two million, one hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •