Base | Representation |
---|---|
bin | 10000100110000000111… |
… | …110001100100001110011 |
3 | 11001000101120022012120012 |
4 | 100212000332030201303 |
5 | 122140344002340311 |
6 | 2231505504005135 |
7 | 145246305050132 |
oct | 20460076144163 |
9 | 4030346265505 |
10 | 1140330121331 |
11 | 3aa67a697085 |
12 | 1650063007ab |
13 | 836c03738ab |
14 | 3d299849919 |
15 | 1e9e144678b |
hex | 10980f8c873 |
1140330121331 has 2 divisors, whose sum is σ = 1140330121332. Its totient is φ = 1140330121330.
The previous prime is 1140330121297. The next prime is 1140330121433. The reversal of 1140330121331 is 1331210330411.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1140330121331 - 230 = 1139256379507 is a prime.
It is a super-2 number, since 2×11403301213312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1140330121297 and 1140330121306.
It is not a weakly prime, because it can be changed into another prime (1140330321331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570165060665 + 570165060666.
It is an arithmetic number, because the mean of its divisors is an integer number (570165060666).
Almost surely, 21140330121331 is an apocalyptic number.
1140330121331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1140330121331 is an equidigital number, since it uses as much as digits as its factorization.
1140330121331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1140330121331 its reverse (1331210330411), we get a palindrome (2471540451742).
The spelling of 1140330121331 in words is "one trillion, one hundred forty billion, three hundred thirty million, one hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •