Base | Representation |
---|---|
bin | 100001100000001011110… |
… | …101010101100110000001 |
3 | 22011002122022111220012200 |
4 | 201200023311111212001 |
5 | 300210103024031423 |
6 | 4521355032343413 |
7 | 325223110424400 |
oct | 41401365254601 |
9 | 8132568456180 |
10 | 2302301002113 |
11 | 808444993022 |
12 | 31224bb44b69 |
13 | 13914bcc9298 |
14 | 7d609441637 |
15 | 3ed4c6a9d43 |
hex | 2180bd55981 |
2302301002113 has 18 divisors (see below), whose sum is σ = 3868492160754. Its totient is φ = 1315600572384.
The previous prime is 2302301002021. The next prime is 2302301002171. The reversal of 2302301002113 is 3112001032032.
It can be written as a sum of positive squares in only one way, i.e., 2253745557504 + 48555444609 = 1501248^2 + 220353^2 .
It is not a de Polignac number, because 2302301002113 - 220 = 2302299953537 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2302301002193) 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 17 ways as a sum of consecutive naturals, for example, 2610318156 + ... + 2610319037.
It is an arithmetic number, because the mean of its divisors is an integer number (214916231153).
Almost surely, 22302301002113 is an apocalyptic number.
It is an amenable number.
2302301002113 is a deficient number, since it is larger than the sum of its proper divisors (1566191158641).
2302301002113 is a wasteful number, since it uses less digits than its factorization.
2302301002113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5220637213 (or 5220637203 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 2302301002113 its reverse (3112001032032), we get a palindrome (5414302034145).
The spelling of 2302301002113 in words is "two trillion, three hundred two billion, three hundred one million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •