Base | Representation |
---|---|
bin | 1011101101100100001… |
… | …1101010101111110101 |
3 | 201020100200022210110220 |
4 | 2323121003222233311 |
5 | 11244034242104023 |
6 | 232233515004553 |
7 | 20352113512200 |
oct | 2733103525765 |
9 | 636320283426 |
10 | 201210113013 |
11 | 78372954aa8 |
12 | 32bb4a39759 |
13 | 15c87c44790 |
14 | 9a4aac4937 |
15 | 537980b3e3 |
hex | 2ed90eabf5 |
201210113013 has 24 divisors (see below), whose sum is σ = 336087224928. Its totient is φ = 106132805856.
The previous prime is 201210112981. The next prime is 201210113047. The reversal of 201210113013 is 310311012102.
It is a happy number.
It is not a de Polignac number, because 201210113013 - 25 = 201210112981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201210112983 and 201210113001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201210111013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 52643331 + ... + 52647152.
It is an arithmetic number, because the mean of its divisors is an integer number (14003634372).
Almost surely, 2201210113013 is an apocalyptic number.
It is an amenable number.
201210113013 is a deficient number, since it is larger than the sum of its proper divisors (134877111915).
201210113013 is a wasteful number, since it uses less digits than its factorization.
201210113013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105290513 (or 105290506 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 201210113013 its reverse (310311012102), we get a palindrome (511521125115).
The spelling of 201210113013 in words is "two hundred one billion, two hundred ten million, one hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •