Base | Representation |
---|---|
bin | 100111111101100… |
… | …0011001111011001 |
3 | 10110110002202100001 |
4 | 1033323003033121 |
5 | 10221231123313 |
6 | 341015413001 |
7 | 45141201436 |
oct | 11773031731 |
9 | 3413082301 |
10 | 1340879833 |
11 | 628989957 |
12 | 315084161 |
13 | 184a4c127 |
14 | ca122b8d |
15 | 7cab7add |
hex | 4fec33d9 |
1340879833 has 2 divisors, whose sum is σ = 1340879834. Its totient is φ = 1340879832.
The previous prime is 1340879831. The next prime is 1340879863. The reversal of 1340879833 is 3389780431.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 677456784 + 663423049 = 26028^2 + 25757^2 .
It is a cyclic number.
It is not a de Polignac number, because 1340879833 - 21 = 1340879831 is a prime.
It is a super-2 number, since 2×13408798332 = 3595917453092215778, which contains 22 as substring.
Together with 1340879831, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1340879831) 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, 670439916 + 670439917.
It is an arithmetic number, because the mean of its divisors is an integer number (670439917).
Almost surely, 21340879833 is an apocalyptic number.
It is an amenable number.
1340879833 is a deficient number, since it is larger than the sum of its proper divisors (1).
1340879833 is an equidigital number, since it uses as much as digits as its factorization.
1340879833 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 435456, while the sum is 46.
The square root of 1340879833 is about 36618.0260664061. The cubic root of 1340879833 is about 1102.7150104017.
The spelling of 1340879833 in words is "one billion, three hundred forty million, eight hundred seventy-nine thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •