Base | Representation |
---|---|
bin | 1001100011110001001011… |
… | …00111010001110010110001 |
3 | 2202102111210221122001201011 |
4 | 10301320211213101302301 |
5 | 10223343332424000423 |
6 | 112412314054110521 |
7 | 4266442114315660 |
oct | 461704547216261 |
9 | 82374727561634 |
10 | 21020201000113 |
11 | 6774687518347 |
12 | 2435a3294b441 |
13 | b962727a1783 |
14 | 52955154cdd7 |
15 | 266bb4d1db0d |
hex | 131e259d1cb1 |
21020201000113 has 8 divisors (see below), whose sum is σ = 25287459849920. Its totient is φ = 17069035398480.
The previous prime is 21020201000077. The next prime is 21020201000129. The reversal of 21020201000113 is 31100010202012.
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 21020201000113 - 225 = 21020167445681 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21020201000093 and 21020201000102.
It is not an unprimeable number, because it can be changed into a prime (21020201009113) 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, 79023311898 + ... + 79023312163.
It is an arithmetic number, because the mean of its divisors is an integer number (3160932481240).
Almost surely, 221020201000113 is an apocalyptic number.
It is an amenable number.
21020201000113 is a deficient number, since it is larger than the sum of its proper divisors (4267258849807).
21020201000113 is a wasteful number, since it uses less digits than its factorization.
21020201000113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158046624087.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 21020201000113 its reverse (31100010202012), we get a palindrome (52120211202125).
The spelling of 21020201000113 in words is "twenty-one trillion, twenty billion, two hundred one million, one hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •