Base | Representation |
---|---|
bin | 101101111110011010100011… |
… | …111100110110101110100101 |
3 | 222111221020200202021211021212 |
4 | 231332122203330312232211 |
5 | 203000331100034000401 |
6 | 1554013543014521205 |
7 | 60406361516150621 |
oct | 5576324374665645 |
9 | 874836622254255 |
10 | 202201221000101 |
11 | 59478068974824 |
12 | 1a817b4b966205 |
13 | 88a9654aaa28b |
14 | 37d083c7d0181 |
15 | 1859ab77c8dbb |
hex | b7e6a3f36ba5 |
202201221000101 has 8 divisors (see below), whose sum is σ = 211343647631424. Its totient is φ = 193088050135200.
The previous prime is 202201221000067. The next prime is 202201221000113. The reversal of 202201221000101 is 101000122102202.
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 202201221000101 - 226 = 202201153891237 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202201221030101) 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, 7313927471 + ... + 7313955116.
It is an arithmetic number, because the mean of its divisors is an integer number (26417955953928).
Almost surely, 2202201221000101 is an apocalyptic number.
It is an amenable number.
202201221000101 is a deficient number, since it is larger than the sum of its proper divisors (9142426631323).
202201221000101 is a wasteful number, since it uses less digits than its factorization.
202201221000101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14627883211.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 202201221000101 its reverse (101000122102202), we get a palindrome (303201343102303).
The spelling of 202201221000101 in words is "two hundred two trillion, two hundred one billion, two hundred twenty-one million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •