Base | Representation |
---|---|
bin | 111100110101010… |
… | …0111010010100101 |
3 | 12021020220102100212 |
4 | 1321222213102211 |
5 | 13140022322432 |
6 | 534314145205 |
7 | 101404014365 |
oct | 17152472245 |
9 | 5236812325 |
10 | 2041214117 |
11 | 958237418 |
12 | 48b722205 |
13 | 266b77707 |
14 | 1551469a5 |
15 | be3042b2 |
hex | 79aa74a5 |
2041214117 has 2 divisors, whose sum is σ = 2041214118. Its totient is φ = 2041214116.
The previous prime is 2041214111. The next prime is 2041214129. The reversal of 2041214117 is 7114121402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1553069281 + 488144836 = 39409^2 + 22094^2 .
It is a cyclic number.
It is not a de Polignac number, because 2041214117 - 210 = 2041213093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2041214092 and 2041214101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2041214111) 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, 1020607058 + 1020607059.
It is an arithmetic number, because the mean of its divisors is an integer number (1020607059).
Almost surely, 22041214117 is an apocalyptic number.
It is an amenable number.
2041214117 is a deficient number, since it is larger than the sum of its proper divisors (1).
2041214117 is an equidigital number, since it uses as much as digits as its factorization.
2041214117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 23.
The square root of 2041214117 is about 45179.7976644429. The cubic root of 2041214117 is about 1268.5166961246.
Adding to 2041214117 its reverse (7114121402), we get a palindrome (9155335519).
The spelling of 2041214117 in words is "two billion, forty-one million, two hundred fourteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •