Base | Representation |
---|---|
bin | 10011001111001110000… |
… | …100110100100010010011 |
3 | 11200101100022102200110111 |
4 | 103033032010310202103 |
5 | 133124440124031011 |
6 | 2451154000142151 |
7 | 164340461253103 |
oct | 23171604644223 |
9 | 4611308380414 |
10 | 1322012330131 |
11 | 46a73154a669 |
12 | 19426b307957 |
13 | 9788567575c |
14 | 47db2c19203 |
15 | 245c668c121 |
hex | 133ce134893 |
1322012330131 has 4 divisors (see below), whose sum is σ = 1340122088152. Its totient is φ = 1303902572112.
The previous prime is 1322012330081. The next prime is 1322012330167. The reversal of 1322012330131 is 1310332102231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1322012330131 - 217 = 1322012199059 is a prime.
It is a super-2 number, since 2×13220123301312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1322012330531) 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 in 3 ways as a sum of consecutive naturals, for example, 9054878901 + ... + 9054879046.
It is an arithmetic number, because the mean of its divisors is an integer number (335030522038).
Almost surely, 21322012330131 is an apocalyptic number.
1322012330131 is a deficient number, since it is larger than the sum of its proper divisors (18109758021).
1322012330131 is an equidigital number, since it uses as much as digits as its factorization.
1322012330131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18109758020.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1322012330131 its reverse (1310332102231), we get a palindrome (2632344432362).
The spelling of 1322012330131 in words is "one trillion, three hundred twenty-two billion, twelve million, three hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •