Base | Representation |
---|---|
bin | 101101111011100000010001… |
… | …111000111011010100111011 |
3 | 222111020010102002020220012212 |
4 | 231323200101320323110323 |
5 | 202434041430203014321 |
6 | 1553342023205325335 |
7 | 60356051044544354 |
oct | 5573402170732473 |
9 | 874203362226185 |
10 | 202001202001211 |
11 | 59400257407468 |
12 | 1a7a5229a0684b |
13 | 8893829868572 |
14 | 37c4ca5da4d2b |
15 | 18547ac85055b |
hex | b7b811e3b53b |
202001202001211 has 8 divisors (see below), whose sum is σ = 202342949281440. Its totient is φ = 201659458440832.
The previous prime is 202001202001187. The next prime is 202001202001273. The reversal of 202001202001211 is 112100202100202.
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 202001202001211 - 26 = 202001202001147 is a prime.
It is a super-2 number, since 2×2020012020012112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202001202006211) 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, 121354481 + ... + 123007773.
It is an arithmetic number, because the mean of its divisors is an integer number (25292868660180).
Almost surely, 2202001202001211 is an apocalyptic number.
202001202001211 is a deficient number, since it is larger than the sum of its proper divisors (341747280229).
202001202001211 is a wasteful number, since it uses less digits than its factorization.
202001202001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1859925.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 202001202001211 its reverse (112100202100202), we get a palindrome (314101404101413).
The spelling of 202001202001211 in words is "two hundred two trillion, one billion, two hundred two million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •