Base | Representation |
---|---|
bin | 10011010111111000111… |
… | …111010001110111101101 |
3 | 11201021101010122201022222 |
4 | 103113320333101313231 |
5 | 133303021442413201 |
6 | 2455333451445125 |
7 | 165120256155035 |
oct | 23277077216755 |
9 | 4637333581288 |
10 | 1331322232301 |
11 | 473679768996 |
12 | 1960291567a5 |
13 | 9870a3ac9c9 |
14 | 486174608c5 |
15 | 2496db8191b |
hex | 135f8fd1ded |
1331322232301 has 4 divisors (see below), whose sum is σ = 1331815500000. Its totient is φ = 1330828964604.
The previous prime is 1331322232297. The next prime is 1331322232327. The reversal of 1331322232301 is 1032322231331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1331322232301 - 22 = 1331322232297 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331322222301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 246629801 + ... + 246635198.
It is an arithmetic number, because the mean of its divisors is an integer number (332953875000).
Almost surely, 21331322232301 is an apocalyptic number.
It is an amenable number.
1331322232301 is a deficient number, since it is larger than the sum of its proper divisors (493267699).
1331322232301 is an equidigital number, since it uses as much as digits as its factorization.
1331322232301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493267698.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 1331322232301 its reverse (1032322231331), we get a palindrome (2363644463632).
The spelling of 1331322232301 in words is "one trillion, three hundred thirty-one billion, three hundred twenty-two million, two hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •