Base | Representation |
---|---|
bin | 101101111110011010100011… |
… | …010111011110101010101101 |
3 | 222111221020200001212001010102 |
4 | 231332122203113132222231 |
5 | 203000331040031432341 |
6 | 1554013542024520445 |
7 | 60406361336652440 |
oct | 5576324327365255 |
9 | 874836601761112 |
10 | 202201211202221 |
11 | 59478063392500 |
12 | 1a817b48620125 |
13 | 88a9652a5970a |
14 | 37d083b39d657 |
15 | 1859ab69e0c9b |
hex | b7e6a35deaad |
202201211202221 has 48 divisors (see below), whose sum is σ = 260867525063040. Its totient is φ = 153355330128000.
The previous prime is 202201211202209. The next prime is 202201211202241. The reversal of 202201211202221 is 122202112102202.
It is a de Polignac number, because none of the positive numbers 2k-202201211202221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202201211202193 and 202201211202202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202201211202241) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 14983466 + ... + 25078011.
It is an arithmetic number, because the mean of its divisors is an integer number (5434740105480).
Almost surely, 2202201211202221 is an apocalyptic number.
It is an amenable number.
202201211202221 is a deficient number, since it is larger than the sum of its proper divisors (58666313860819).
202201211202221 is a wasteful number, since it uses less digits than its factorization.
202201211202221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40061666 (or 40061655 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 202201211202221 its reverse (122202112102202), we get a palindrome (324403323304423).
The spelling of 202201211202221 in words is "two hundred two trillion, two hundred one billion, two hundred eleven million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •