Base | Representation |
---|---|
bin | 1001010010011111001001… |
… | …0110000000111111110001 |
3 | 1100011101001200111221012102 |
4 | 2110213302112000333301 |
5 | 2314313114444320423 |
6 | 33415514123510145 |
7 | 2102610460100000 |
oct | 224476226007761 |
9 | 40141050457172 |
10 | 10213203120113 |
11 | 32884389a3834 |
12 | 118b479088355 |
13 | 5911409568b6 |
14 | 274470930c37 |
15 | 12aa0758cc28 |
hex | 949f2580ff1 |
10213203120113 has 12 divisors (see below), whose sum is σ = 11915302380480. Its totient is φ = 8754174088548.
The previous prime is 10213203120079. The next prime is 10213203120119. The reversal of 10213203120113 is 31102130231201.
It is a happy number.
10213203120113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10213203120113 - 26 = 10213203120049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10213203120119) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 303820973 + ... + 303854586.
It is an arithmetic number, because the mean of its divisors is an integer number (992941865040).
Almost surely, 210213203120113 is an apocalyptic number.
It is an amenable number.
10213203120113 is a deficient number, since it is larger than the sum of its proper divisors (1702099260367).
10213203120113 is an frugal number, since it uses more digits than its factorization.
10213203120113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 607675594 (or 607675566 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 10213203120113 its reverse (31102130231201), we get a palindrome (41315333351314).
The spelling of 10213203120113 in words is "ten trillion, two hundred thirteen billion, two hundred three million, one hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •