Base | Representation |
---|---|
bin | 10011001111100001000… |
… | …101010010100010000101 |
3 | 11200102011112110222021010 |
4 | 103033201011102202011 |
5 | 133131113243020401 |
6 | 2451245351112433 |
7 | 164351412626343 |
oct | 23174105224205 |
9 | 4612145428233 |
10 | 1322331220101 |
11 | 46a8855563a1 |
12 | 19433a072719 |
13 | 97906758648 |
14 | 48003308993 |
15 | 245e467ced6 |
hex | 133e1152885 |
1322331220101 has 8 divisors (see below), whose sum is σ = 1784350562400. Its totient is φ = 870933012272.
The previous prime is 1322331220073. The next prime is 1322331220121. The reversal of 1322331220101 is 1010221332231.
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 1322331220101 - 219 = 1322330695813 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1322331220121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2655283326 + ... + 2655283823.
It is an arithmetic number, because the mean of its divisors is an integer number (223043820300).
Almost surely, 21322331220101 is an apocalyptic number.
It is an amenable number.
1322331220101 is a deficient number, since it is larger than the sum of its proper divisors (462019342299).
1322331220101 is an equidigital number, since it uses as much as digits as its factorization.
1322331220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5310567235.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1322331220101 its reverse (1010221332231), we get a palindrome (2332552552332).
The spelling of 1322331220101 in words is "one trillion, three hundred twenty-two billion, three hundred thirty-one million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •