Base | Representation |
---|---|
bin | 1000100111011110… |
… | …0000101001001101 |
3 | 12222012101002221222 |
4 | 2021313200221031 |
5 | 14214113431341 |
6 | 1021304133125 |
7 | 111214301225 |
oct | 21167405115 |
9 | 5865332858 |
10 | 2313030221 |
11 | a87710927 |
12 | 5467671a5 |
13 | 2ab288048 |
14 | 17d2a1085 |
15 | d80e744b |
hex | 89de0a4d |
2313030221 has 4 divisors (see below), whose sum is σ = 2313159744. Its totient is φ = 2312900700.
The previous prime is 2313030199. The next prime is 2313030229. The reversal of 2313030221 is 1220303132.
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 a de Polignac number, because none of the positive numbers 2k-2313030221 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 2313030221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2313030229) 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, 32675 + ... + 75456.
It is an arithmetic number, because the mean of its divisors is an integer number (578289936).
Almost surely, 22313030221 is an apocalyptic number.
It is an amenable number.
2313030221 is a deficient number, since it is larger than the sum of its proper divisors (129523).
2313030221 is a wasteful number, since it uses less digits than its factorization.
2313030221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129522.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 2313030221 is about 48093.9728136489. The cubic root of 2313030221 is about 1322.4941786449.
Adding to 2313030221 its reverse (1220303132), we get a palindrome (3533333353).
The spelling of 2313030221 in words is "two billion, three hundred thirteen million, thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.377 sec. • engine limits •