Base | Representation |
---|---|
bin | 111111000110101… |
… | …0101110001010001 |
3 | 12110120022101202201 |
4 | 1332031111301101 |
5 | 13314030120012 |
6 | 550035443201 |
7 | 103320553252 |
oct | 17615256121 |
9 | 5416271681 |
10 | 2117426257 |
11 | 997260761 |
12 | 4b1156501 |
13 | 2798ac95b |
14 | 161304b29 |
15 | c5d5a857 |
hex | 7e355c51 |
2117426257 has 4 divisors (see below), whose sum is σ = 2121586740. Its totient is φ = 2113265776.
The previous prime is 2117426249. The next prime is 2117426293. The reversal of 2117426257 is 7526247112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 888993856 + 1228432401 = 29816^2 + 35049^2 .
It is a cyclic number.
It is not a de Polignac number, because 2117426257 - 23 = 2117426249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2117426357) 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 in 3 ways as a sum of consecutive naturals, for example, 2079478 + ... + 2080495.
It is an arithmetic number, because the mean of its divisors is an integer number (530396685).
Almost surely, 22117426257 is an apocalyptic number.
It is an amenable number.
2117426257 is a deficient number, since it is larger than the sum of its proper divisors (4160483).
2117426257 is an equidigital number, since it uses as much as digits as its factorization.
2117426257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4160482.
The product of its digits is 47040, while the sum is 37.
The square root of 2117426257 is about 46015.5001820039. The cubic root of 2117426257 is about 1284.1115868592. Note that the first 3 decimals are identical.
The spelling of 2117426257 in words is "two billion, one hundred seventeen million, four hundred twenty-six thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •