Base | Representation |
---|---|
bin | 10011011001101001110… |
… | …001000010010110100011 |
3 | 11201110020222221221101011 |
4 | 103121221301002112203 |
5 | 133320410331333011 |
6 | 2500245321521351 |
7 | 165215202526534 |
oct | 23315161022643 |
9 | 4643228857334 |
10 | 1333214324131 |
11 | 47445a802548 |
12 | 196476943257 |
13 | 9894c3a4b81 |
14 | 4875686a68b |
15 | 24a2ed2b621 |
hex | 13669c425a3 |
1333214324131 has 2 divisors, whose sum is σ = 1333214324132. Its totient is φ = 1333214324130.
The previous prime is 1333214324033. The next prime is 1333214324161. The reversal of 1333214324131 is 1314234123331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1333214324131 - 215 = 1333214291363 is a prime.
It is a super-2 number, since 2×13332143241312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1333214324093 and 1333214324102.
It is not a weakly prime, because it can be changed into another prime (1333214324161) 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, 666607162065 + 666607162066.
It is an arithmetic number, because the mean of its divisors is an integer number (666607162066).
Almost surely, 21333214324131 is an apocalyptic number.
1333214324131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1333214324131 is an equidigital number, since it uses as much as digits as its factorization.
1333214324131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15552, while the sum is 31.
Adding to 1333214324131 its reverse (1314234123331), we get a palindrome (2647448447462).
The spelling of 1333214324131 in words is "one trillion, three hundred thirty-three billion, two hundred fourteen million, three hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •