Base | Representation |
---|---|
bin | 111110111100111… |
… | …0100110000011101 |
3 | 12110012200110222212 |
4 | 1331321310300131 |
5 | 13311222412201 |
6 | 545334050205 |
7 | 103226225033 |
oct | 17571646035 |
9 | 5405613885 |
10 | 2112310301 |
11 | 994386aa2 |
12 | 4ab4a9965 |
13 | 27880b16a |
14 | 160772553 |
15 | c5699abb |
hex | 7de74c1d |
2112310301 has 4 divisors (see below), whose sum is σ = 2132818272. Its totient is φ = 2091802332.
The previous prime is 2112310267. The next prime is 2112310411. The reversal of 2112310301 is 1030132112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2112310301 - 230 = 1038568477 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 (2112310901) 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 3 ways as a sum of consecutive naturals, for example, 10253831 + ... + 10254036.
It is an arithmetic number, because the mean of its divisors is an integer number (533204568).
Almost surely, 22112310301 is an apocalyptic number.
It is an amenable number.
2112310301 is a deficient number, since it is larger than the sum of its proper divisors (20507971).
2112310301 is a wasteful number, since it uses less digits than its factorization.
2112310301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20507970.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 2112310301 is about 45959.8770777294. The cubic root of 2112310301 is about 1283.0765635873.
Adding to 2112310301 its reverse (1030132112), we get a palindrome (3142442413).
The spelling of 2112310301 in words is "two billion, one hundred twelve million, three hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •