Base | Representation |
---|---|
bin | 11111000110110110010… |
… | …010011001001111101001 |
3 | 21120100122222211002022201 |
4 | 133012312102121033221 |
5 | 240010410144141132 |
6 | 4314005344420201 |
7 | 310304063611021 |
oct | 37066622311751 |
9 | 7510588732281 |
10 | 2137657021417 |
11 | 754636729495 |
12 | 2a6361017661 |
13 | 1267708b39b8 |
14 | 7566ac62a81 |
15 | 3a91318d2e7 |
hex | 1f1b64993e9 |
2137657021417 has 4 divisors (see below), whose sum is σ = 2138090013396. Its totient is φ = 2137224029440.
The previous prime is 2137657021399. The next prime is 2137657021429. The reversal of 2137657021417 is 7141207567312.
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 1740106595161 + 397550426256 = 1319131^2 + 630516^2 .
It is a cyclic number.
It is not a de Polignac number, because 2137657021417 - 231 = 2135509537769 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2137657028417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 216488584 + ... + 216498457.
It is an arithmetic number, because the mean of its divisors is an integer number (534522503349).
Almost surely, 22137657021417 is an apocalyptic number.
It is an amenable number.
2137657021417 is a deficient number, since it is larger than the sum of its proper divisors (432991979).
2137657021417 is an equidigital number, since it uses as much as digits as its factorization.
2137657021417 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432991978.
The product of its (nonzero) digits is 493920, while the sum is 46.
The spelling of 2137657021417 in words is "two trillion, one hundred thirty-seven billion, six hundred fifty-seven million, twenty-one thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •