Base | Representation |
---|---|
bin | 1000101110001101… |
… | …1001011101101001 |
3 | 20001011120222202122 |
4 | 2023203121131221 |
5 | 14243333443421 |
6 | 1024154241025 |
7 | 112006553363 |
oct | 21343313551 |
9 | 6034528678 |
10 | 2341312361 |
11 | aa16786a3 |
12 | 554126175 |
13 | 2b40ab13b |
14 | 182d43d33 |
15 | da8322ab |
hex | 8b8d9769 |
2341312361 has 8 divisors (see below), whose sum is σ = 2422588800. Its totient is φ = 2260072080.
The previous prime is 2341312357. The next prime is 2341312367. The reversal of 2341312361 is 1632131432.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2341312361 - 22 = 2341312357 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2341312361.
It is not an unprimeable number, because it can be changed into a prime (2341312367) 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 7 ways as a sum of consecutive naturals, for example, 232256 + ... + 242126.
It is an arithmetic number, because the mean of its divisors is an integer number (302823600).
Almost surely, 22341312361 is an apocalyptic number.
It is an amenable number.
2341312361 is a deficient number, since it is larger than the sum of its proper divisors (81276439).
2341312361 is an equidigital number, since it uses as much as digits as its factorization.
2341312361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18079.
The product of its digits is 2592, while the sum is 26.
The square root of 2341312361 is about 48387.1094507618. The cubic root of 2341312361 is about 1327.8625400934.
Adding to 2341312361 its reverse (1632131432), we get a palindrome (3973443793).
The spelling of 2341312361 in words is "two billion, three hundred forty-one million, three hundred twelve thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •