Base | Representation |
---|---|
bin | 10011001111001111001… |
… | …000101100010010010011 |
3 | 11200101101112220121111110 |
4 | 103033033020230102103 |
5 | 133130004202402011 |
6 | 2451155433344403 |
7 | 164341065424605 |
oct | 23171710542223 |
9 | 4611345817443 |
10 | 1322030122131 |
11 | 46a7405a1aa4 |
12 | 194275268103 |
13 | 97889264b74 |
14 | 47db532b175 |
15 | 245c8003ba6 |
hex | 133cf22c493 |
1322030122131 has 8 divisors (see below), whose sum is σ = 1762946715600. Its totient is φ = 881233471712.
The previous prime is 1322030122087. The next prime is 1322030122181. The reversal of 1322030122131 is 1312210302231.
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 1322030122131 - 211 = 1322030120083 is a prime.
It is a super-2 number, since 2×13220301221312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1322030122098 and 1322030122107.
It is not an unprimeable number, because it can be changed into a prime (1322030122181) 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, 29960040 + ... + 30004133.
It is an arithmetic number, because the mean of its divisors is an integer number (220368339450).
Almost surely, 21322030122131 is an apocalyptic number.
1322030122131 is a deficient number, since it is larger than the sum of its proper divisors (440916593469).
1322030122131 is an equidigital number, since it uses as much as digits as its factorization.
1322030122131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59971525.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1322030122131 its reverse (1312210302231), we get a palindrome (2634240424362).
The spelling of 1322030122131 in words is "one trillion, three hundred twenty-two billion, thirty million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •