Base | Representation |
---|---|
bin | 101101111110110110100100… |
… | …111011100100011010001101 |
3 | 222112001010100011101200100221 |
4 | 231332312210323210122031 |
5 | 203001324201331224323 |
6 | 1554035435551351341 |
7 | 60411505123215562 |
oct | 5576664473443215 |
9 | 875033304350327 |
10 | 202231302211213 |
11 | 594898a4a36980 |
12 | 1a821945b22551 |
13 | 88ac439c37a92 |
14 | 37d2093938869 |
15 | 185a7785e555d |
hex | b7eda4ee468d |
202231302211213 has 32 divisors (see below), whose sum is σ = 238485899808000. Its totient is φ = 169547184576000.
The previous prime is 202231302211189. The next prime is 202231302211291. The reversal of 202231302211213 is 312112203132202.
It is a de Polignac number, because none of the positive numbers 2k-202231302211213 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 (202231302211313) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14516688 + ... + 24803161.
It is an arithmetic number, because the mean of its divisors is an integer number (7452684369000).
Almost surely, 2202231302211213 is an apocalyptic number.
202231302211213 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
202231302211213 is a deficient number, since it is larger than the sum of its proper divisors (36254597596787).
202231302211213 is a wasteful number, since it uses less digits than its factorization.
202231302211213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39320613.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 202231302211213 its reverse (312112203132202), we get a palindrome (514343505343415).
The spelling of 202231302211213 in words is "two hundred two trillion, two hundred thirty-one billion, three hundred two million, two hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •