Base | Representation |
---|---|
bin | 100001101110001011010… |
… | …000001001011110011001 |
3 | 22012112102021020220102122 |
4 | 201232023100021132121 |
5 | 300431334322414211 |
6 | 4532321435511025 |
7 | 326264303633552 |
oct | 41561320113631 |
9 | 8175367226378 |
10 | 2317323638681 |
11 | 813853866247 |
12 | 315142bb8475 |
13 | 13a6a443c84c |
14 | 80232679329 |
15 | 4042b4916db |
hex | 21b8b409799 |
2317323638681 has 8 divisors (see below), whose sum is σ = 2380625118720. Its totient is φ = 2254057480368.
The previous prime is 2317323638639. The next prime is 2317323638699. The reversal of 2317323638681 is 1868363237132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2317323638681 - 214 = 2317323622297 is a prime.
It is a super-2 number, since 2×23173236386812 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2317323632681) 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 in 7 ways as a sum of consecutive naturals, for example, 8697401 + ... + 8959878.
It is an arithmetic number, because the mean of its divisors is an integer number (297578139840).
Almost surely, 22317323638681 is an apocalyptic number.
It is an amenable number.
2317323638681 is a deficient number, since it is larger than the sum of its proper divisors (63301480039).
2317323638681 is a wasteful number, since it uses less digits than its factorization.
2317323638681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17660863.
The product of its digits is 5225472, while the sum is 53.
The spelling of 2317323638681 in words is "two trillion, three hundred seventeen billion, three hundred twenty-three million, six hundred thirty-eight thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •