Base | Representation |
---|---|
bin | 10011010111110011000… |
… | …101000110011101011011 |
3 | 11201021010020010000200221 |
4 | 103113303011012131123 |
5 | 133302321103021011 |
6 | 2455315550540511 |
7 | 165114643415266 |
oct | 23276305063533 |
9 | 4637106100627 |
10 | 1331223095131 |
11 | 473628806746 |
12 | 195bbbb07737 |
13 | 986c29abb67 |
14 | 48608215cdd |
15 | 249650ec971 |
hex | 135f314675b |
1331223095131 has 2 divisors, whose sum is σ = 1331223095132. Its totient is φ = 1331223095130.
The previous prime is 1331223095123. The next prime is 1331223095183. The reversal of 1331223095131 is 1315903221331.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1331223095131 - 23 = 1331223095123 is a prime.
It is a super-2 number, since 2×13312230951312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1331223095101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665611547565 + 665611547566.
It is an arithmetic number, because the mean of its divisors is an integer number (665611547566).
Almost surely, 21331223095131 is an apocalyptic number.
1331223095131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331223095131 is an equidigital number, since it uses as much as digits as its factorization.
1331223095131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 34.
The spelling of 1331223095131 in words is "one trillion, three hundred thirty-one billion, two hundred twenty-three million, ninety-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •