Base | Representation |
---|---|
bin | 100001100010000101100… |
… | …110111010001010100101 |
3 | 22011021220200211222110022 |
4 | 201202011212322022211 |
5 | 300223244033240401 |
6 | 4522333454004525 |
7 | 325324536106355 |
oct | 41420546721245 |
9 | 8137820758408 |
10 | 2304344040101 |
11 | 8092a3155774 |
12 | 3127201a6745 |
13 | 1393b6361bbc |
14 | 7d760900b65 |
15 | 3ee1bc1e71b |
hex | 218859ba2a5 |
2304344040101 has 4 divisors (see below), whose sum is σ = 2304635700204. Its totient is φ = 2304052380000.
The previous prime is 2304344040079. The next prime is 2304344040113. The reversal of 2304344040101 is 1010404434032.
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 812159637601 + 1492184402500 = 901199^2 + 1221550^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2304344040101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2304344040601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 145818200 + ... + 145834001.
It is an arithmetic number, because the mean of its divisors is an integer number (576158925051).
Almost surely, 22304344040101 is an apocalyptic number.
It is an amenable number.
2304344040101 is a deficient number, since it is larger than the sum of its proper divisors (291660103).
2304344040101 is an equidigital number, since it uses as much as digits as its factorization.
2304344040101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 291660102.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 2304344040101 its reverse (1010404434032), we get a palindrome (3314748474133).
The spelling of 2304344040101 in words is "two trillion, three hundred four billion, three hundred forty-four million, forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •