Base | Representation |
---|---|
bin | 111100110011001… |
… | …1100010001011101 |
3 | 12021011211212002022 |
4 | 1321212130101131 |
5 | 13134232323123 |
6 | 534234505525 |
7 | 101361510632 |
oct | 17146342135 |
9 | 5234755068 |
10 | 2040120413 |
11 | 95765a731 |
12 | 48b2952a5 |
13 | 266883956 |
14 | 154d40189 |
15 | be18a1c8 |
hex | 7999c45d |
2040120413 has 2 divisors, whose sum is σ = 2040120414. Its totient is φ = 2040120412.
The previous prime is 2040120371. The next prime is 2040120427. The reversal of 2040120413 is 3140210402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1883820409 + 156300004 = 43403^2 + 12502^2 .
It is a cyclic number.
It is not a de Polignac number, because 2040120413 - 214 = 2040104029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2040120391 and 2040120400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2040120443) 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, 1020060206 + 1020060207.
It is an arithmetic number, because the mean of its divisors is an integer number (1020060207).
Almost surely, 22040120413 is an apocalyptic number.
It is an amenable number.
2040120413 is a deficient number, since it is larger than the sum of its proper divisors (1).
2040120413 is an equidigital number, since it uses as much as digits as its factorization.
2040120413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 2040120413 is about 45167.6921371903. The cubic root of 2040120413 is about 1268.2900941172.
Adding to 2040120413 its reverse (3140210402), we get a palindrome (5180330815).
The spelling of 2040120413 in words is "two billion, forty million, one hundred twenty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •