Base | Representation |
---|---|
bin | 1000100111100000… |
… | …1100100010100101 |
3 | 12222012201020121020 |
4 | 2021320030202211 |
5 | 14214140210041 |
6 | 1021312041353 |
7 | 111215650353 |
oct | 21170144245 |
9 | 5865636536 |
10 | 2313210021 |
11 | a87823a21 |
12 | 546833259 |
13 | 2ab31bb35 |
14 | 17d30a7d3 |
15 | d8130866 |
hex | 89e0c8a5 |
2313210021 has 8 divisors (see below), whose sum is σ = 3095179680. Its totient is φ = 1536690192.
The previous prime is 2313210007. The next prime is 2313210023. The reversal of 2313210021 is 1200123132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2313210021 - 26 = 2313209957 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2313210023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1361466 + ... + 1363163.
It is an arithmetic number, because the mean of its divisors is an integer number (386897460).
Almost surely, 22313210021 is an apocalyptic number.
It is an amenable number.
2313210021 is a deficient number, since it is larger than the sum of its proper divisors (781969659).
2313210021 is a wasteful number, since it uses less digits than its factorization.
2313210021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2724915.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 2313210021 is about 48095.8420344212. The cubic root of 2313210021 is about 1322.5284451365.
Adding to 2313210021 its reverse (1200123132), we get a palindrome (3513333153).
It can be divided in two parts, 23132 and 10021, that added together give a triangular number (33153 = T257).
The spelling of 2313210021 in words is "two billion, three hundred thirteen million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •