Base | Representation |
---|---|
bin | 10000011101101000101… |
… | …101110010011001001001 |
3 | 11000011011120001212212021 |
4 | 100131220231302121021 |
5 | 122013432301412301 |
6 | 2223421033244441 |
7 | 144510330543514 |
oct | 20355055623111 |
9 | 4004146055767 |
10 | 1131333232201 |
11 | 3a6883130117 |
12 | 163315263721 |
13 | 828b8442563 |
14 | 3ca84a03d7b |
15 | 1e6666818a1 |
hex | 10768b72649 |
1131333232201 has 2 divisors, whose sum is σ = 1131333232202. Its totient is φ = 1131333232200.
The previous prime is 1131333232199. The next prime is 1131333232207. The reversal of 1131333232201 is 1022323331311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1012239222201 + 119094010000 = 1006101^2 + 345100^2 .
It is a cyclic number.
It is not a de Polignac number, because 1131333232201 - 21 = 1131333232199 is a prime.
Together with 1131333232199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1131333232207) 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 as a sum of consecutive naturals, namely, 565666616100 + 565666616101.
It is an arithmetic number, because the mean of its divisors is an integer number (565666616101).
Almost surely, 21131333232201 is an apocalyptic number.
It is an amenable number.
1131333232201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131333232201 is an equidigital number, since it uses as much as digits as its factorization.
1131333232201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 1131333232201 its reverse (1022323331311), we get a palindrome (2153656563512).
The spelling of 1131333232201 in words is "one trillion, one hundred thirty-one billion, three hundred thirty-three million, two hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •