Base | Representation |
---|---|
bin | 10000100110000001110… |
… | …000111010001000100101 |
3 | 11001000102111022121111122 |
4 | 100212001300322020211 |
5 | 122140410403242313 |
6 | 2231511100543325 |
7 | 145246526046143 |
oct | 20460160721045 |
9 | 4030374277448 |
10 | 1140343415333 |
11 | 3aa687147061 |
12 | 16500a851b45 |
13 | 836c3049875 |
14 | 3d29b50a593 |
15 | 1e9e26c0708 |
hex | 10981c3a225 |
1140343415333 has 2 divisors, whose sum is σ = 1140343415334. Its totient is φ = 1140343415332.
The previous prime is 1140343415311. The next prime is 1140343415347. The reversal of 1140343415333 is 3335143430411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1125841957249 + 14501458084 = 1061057^2 + 120422^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1140343415333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1140343415293 and 1140343415302.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1140343415303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570171707666 + 570171707667.
It is an arithmetic number, because the mean of its divisors is an integer number (570171707667).
Almost surely, 21140343415333 is an apocalyptic number.
It is an amenable number.
1140343415333 is a deficient number, since it is larger than the sum of its proper divisors (1).
1140343415333 is an equidigital number, since it uses as much as digits as its factorization.
1140343415333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 77760, while the sum is 35.
Adding to 1140343415333 its reverse (3335143430411), we get a palindrome (4475486845744).
The spelling of 1140343415333 in words is "one trillion, one hundred forty billion, three hundred forty-three million, four hundred fifteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •