Base | Representation |
---|---|
bin | 11011110000110011100111… |
… | …110110110101011000011101 |
3 | 121000022202120222021220122101 |
4 | 123300303213312311120131 |
5 | 112001001244332431023 |
6 | 1111404305354045101 |
7 | 34501344030206053 |
oct | 3360634766653035 |
9 | 530282528256571 |
10 | 122101220202013 |
11 | 359a59226a4a08 |
12 | 1184004b719791 |
13 | 53191322192b0 |
14 | 2221a32a4c1d3 |
15 | e1b1eda491ad |
hex | 6f0ce7db561d |
122101220202013 has 16 divisors (see below), whose sum is σ = 133346378051712. Its totient is φ = 111120759288000.
The previous prime is 122101220201969. The next prime is 122101220202019. The reversal of 122101220202013 is 310202022101221.
It is a cyclic number.
It is not a de Polignac number, because 122101220202013 - 29 = 122101220201501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122101220202019) 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, 327636603 + ... + 328009063.
It is an arithmetic number, because the mean of its divisors is an integer number (8334148628232).
Almost surely, 2122101220202013 is an apocalyptic number.
122101220202013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
122101220202013 is a deficient number, since it is larger than the sum of its proper divisors (11245157849699).
122101220202013 is a wasteful number, since it uses less digits than its factorization.
122101220202013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 727716.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 122101220202013 its reverse (310202022101221), we get a palindrome (432303242303234).
The spelling of 122101220202013 in words is "one hundred twenty-two trillion, one hundred one billion, two hundred twenty million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •