Base | Representation |
---|---|
bin | 1000100111011101… |
… | …1100100000110101 |
3 | 12222012100020202022 |
4 | 2021313130200311 |
5 | 14214112411201 |
6 | 1021303522525 |
7 | 111214201004 |
oct | 21167344065 |
9 | 5865306668 |
10 | 2313013301 |
11 | a876aa145 |
12 | 546759445 |
13 | 2ab280431 |
14 | 17d298c3b |
15 | d80e241b |
hex | 89ddc835 |
2313013301 has 16 divisors (see below), whose sum is σ = 2434806528. Its totient is φ = 2194516800.
The previous prime is 2313013289. The next prime is 2313013309. The reversal of 2313013301 is 1033103132.
2313013301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 2313013301 - 222 = 2308818997 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 2313013301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2313013309) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1878356 + ... + 1879586.
It is an arithmetic number, because the mean of its divisors is an integer number (152175408).
Almost surely, 22313013301 is an apocalyptic number.
It is an amenable number.
2313013301 is a deficient number, since it is larger than the sum of its proper divisors (121793227).
2313013301 is a wasteful number, since it uses less digits than its factorization.
2313013301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2492.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 2313013301 is about 48093.7969077094. The cubic root of 2313013301 is about 1322.4909539203.
Adding to 2313013301 its reverse (1033103132), we get a palindrome (3346116433).
The spelling of 2313013301 in words is "two billion, three hundred thirteen million, thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •