Base | Representation |
---|---|
bin | 11101010010110110101… |
… | …101101011101011001101 |
3 | 21010110012002212010002002 |
4 | 131102312231223223031 |
5 | 230440322142420323 |
6 | 4140450544242045 |
7 | 265304513466440 |
oct | 35226655535315 |
9 | 7113162763062 |
10 | 2013110123213 |
11 | 706834201462 |
12 | 2861a2610325 |
13 | 117ab26b2527 |
14 | 6d613ac3657 |
15 | 37573e33828 |
hex | 1d4b6b6bacd |
2013110123213 has 8 divisors (see below), whose sum is σ = 2302625790528. Its totient is φ = 1724076582624.
The previous prime is 2013110123083. The next prime is 2013110123249. The reversal of 2013110123213 is 3123210113102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2013110123213 - 210 = 2013110122189 is a prime.
It is a super-2 number, since 2×20131101232132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013110123813) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 120522731 + ... + 120539432.
It is an arithmetic number, because the mean of its divisors is an integer number (287828223816).
Almost surely, 22013110123213 is an apocalyptic number.
It is an amenable number.
2013110123213 is a deficient number, since it is larger than the sum of its proper divisors (289515667315).
2013110123213 is a wasteful number, since it uses less digits than its factorization.
2013110123213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241063363.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2013110123213 its reverse (3123210113102), we get a palindrome (5136320236315).
The spelling of 2013110123213 in words is "two trillion, thirteen billion, one hundred ten million, one hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •