Base | Representation |
---|---|
bin | 10011010111111000011… |
… | …000101101100101011001 |
3 | 11201021100102122001212211 |
4 | 103113320120231211121 |
5 | 133303011400402301 |
6 | 2455332451035121 |
7 | 165120104216365 |
oct | 23277030554531 |
9 | 4637312561784 |
10 | 1331312122201 |
11 | 473673a93036 |
12 | 19602589baa1 |
13 | 9870827ccb9 |
14 | 48615d8c2a5 |
15 | 2496cd36051 |
hex | 135f862d959 |
1331312122201 has 4 divisors (see below), whose sum is σ = 1333527284404. Its totient is φ = 1329096960000.
The previous prime is 1331312122187. The next prime is 1331312122213. The reversal of 1331312122201 is 1022212131331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1030022010000 + 301290112201 = 1014900^2 + 548899^2 .
It is a cyclic number.
It is not a de Polignac number, because 1331312122201 - 25 = 1331312122169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1331312122801) 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, 1107580200 + ... + 1107581401.
It is an arithmetic number, because the mean of its divisors is an integer number (333381821101).
Almost surely, 21331312122201 is an apocalyptic number.
It is an amenable number.
1331312122201 is a deficient number, since it is larger than the sum of its proper divisors (2215162203).
1331312122201 is an equidigital number, since it uses as much as digits as its factorization.
1331312122201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2215162202.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 1331312122201 its reverse (1022212131331), we get a palindrome (2353524253532).
The spelling of 1331312122201 in words is "one trillion, three hundred thirty-one billion, three hundred twelve million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •