Base | Representation |
---|---|
bin | 100001100111011110100… |
… | …010011010101101100101 |
3 | 22011211212000001010002101 |
4 | 201213132202122231211 |
5 | 300322122014032323 |
6 | 4525132020412101 |
7 | 325621125346126 |
oct | 41473642325545 |
9 | 8154760033071 |
10 | 2310131002213 |
11 | 8107a27a8a91 |
12 | 313876247031 |
13 | 139ac925a138 |
14 | 7db4d2d604d |
15 | 40159cc4dad |
hex | 219de89ab65 |
2310131002213 has 4 divisors (see below), whose sum is σ = 2313182695180. Its totient is φ = 2307079309248.
The previous prime is 2310131002189. The next prime is 2310131002229. The reversal of 2310131002213 is 3122001310132.
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 902011766049 + 1408119236164 = 949743^2 + 1186642^2 .
It is a cyclic number.
It is not a de Polignac number, because 2310131002213 - 25 = 2310131002181 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 (2310131009213) 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, 1525845348 + ... + 1525846861.
It is an arithmetic number, because the mean of its divisors is an integer number (578295673795).
Almost surely, 22310131002213 is an apocalyptic number.
It is an amenable number.
2310131002213 is a deficient number, since it is larger than the sum of its proper divisors (3051692967).
2310131002213 is an equidigital number, since it uses as much as digits as its factorization.
2310131002213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3051692966.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 2310131002213 its reverse (3122001310132), we get a palindrome (5432132312345).
The spelling of 2310131002213 in words is "two trillion, three hundred ten billion, one hundred thirty-one million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •