Base | Representation |
---|---|
bin | 100010000011101011100… |
… | …111010001011001010001 |
3 | 22021202000120000012110121 |
4 | 202003223213101121101 |
5 | 301321132234242044 |
6 | 4551101043030241 |
7 | 331042445351143 |
oct | 42035347213121 |
9 | 8252016005417 |
10 | 2340415149649 |
11 | 822623379205 |
12 | 31970836b381 |
13 | 13c91445c5c5 |
14 | 813c3388c93 |
15 | 40d2d82a984 |
hex | 220eb9d1651 |
2340415149649 has 2 divisors, whose sum is σ = 2340415149650. Its totient is φ = 2340415149648.
The previous prime is 2340415149587. The next prime is 2340415149707. The reversal of 2340415149649 is 9469415140432.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1722708750400 + 617706399249 = 1312520^2 + 785943^2 .
It is a cyclic number.
It is not a de Polignac number, because 2340415149649 - 211 = 2340415147601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2340415149596 and 2340415149605.
It is not a weakly prime, because it can be changed into another prime (2340415149049) 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, 1170207574824 + 1170207574825.
It is an arithmetic number, because the mean of its divisors is an integer number (1170207574825).
Almost surely, 22340415149649 is an apocalyptic number.
It is an amenable number.
2340415149649 is a deficient number, since it is larger than the sum of its proper divisors (1).
2340415149649 is an equidigital number, since it uses as much as digits as its factorization.
2340415149649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3732480, while the sum is 52.
The spelling of 2340415149649 in words is "two trillion, three hundred forty billion, four hundred fifteen million, one hundred forty-nine thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •