Base | Representation |
---|---|
bin | 100001100001001001001… |
… | …111001111000001101011 |
3 | 22011012022010000102120212 |
4 | 201201021033033001223 |
5 | 300214210241414011 |
6 | 4522045153211335 |
7 | 325260460113152 |
oct | 41411117170153 |
9 | 8135263012525 |
10 | 2303331201131 |
11 | 808923462874 |
12 | 312498b60b4b |
13 | 13928457abbc |
14 | 7d6a61b0599 |
15 | 3edacd5408b |
hex | 218493cf06b |
2303331201131 has 2 divisors, whose sum is σ = 2303331201132. Its totient is φ = 2303331201130.
The previous prime is 2303331201077. The next prime is 2303331201137. The reversal of 2303331201131 is 1311021333032.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2303331201131 - 226 = 2303264092267 is a prime.
It is a super-2 number, since 2×23033312011312 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 2303331201097 and 2303331201106.
It is not a weakly prime, because it can be changed into another prime (2303331201137) 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, 1151665600565 + 1151665600566.
It is an arithmetic number, because the mean of its divisors is an integer number (1151665600566).
Almost surely, 22303331201131 is an apocalyptic number.
2303331201131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2303331201131 is an equidigital number, since it uses as much as digits as its factorization.
2303331201131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 2303331201131 its reverse (1311021333032), we get a palindrome (3614352534163).
The spelling of 2303331201131 in words is "two trillion, three hundred three billion, three hundred thirty-one million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •