Base | Representation |
---|---|
bin | 1001001100011111000011… |
… | …10110011100111100101101 |
3 | 2122121000212112000012012021 |
4 | 10212033201312130330231 |
5 | 10122241432223211341 |
6 | 111001010504510141 |
7 | 4154601260644024 |
oct | 446174166347455 |
9 | 78530775005167 |
10 | 20220200210221 |
11 | 649637a974150 |
12 | 232698817b351 |
13 | b389ab60970b |
14 | 4dc93d05d8bb |
15 | 250e919229d1 |
hex | 1263e1d9cf2d |
20220200210221 has 8 divisors (see below), whose sum is σ = 22306247424000. Its totient is φ = 18175460862240.
The previous prime is 20220200210159. The next prime is 20220200210239. The reversal of 20220200210221 is 12201200202202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20220200210221 - 29 = 20220200209709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20220200210195 and 20220200210204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20220200210261) 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, 10326965421 + ... + 10326967378.
It is an arithmetic number, because the mean of its divisors is an integer number (2788280928000).
Almost surely, 220220200210221 is an apocalyptic number.
It is an amenable number.
20220200210221 is a deficient number, since it is larger than the sum of its proper divisors (2086047213779).
20220200210221 is a wasteful number, since it uses less digits than its factorization.
20220200210221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20653932899.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 20220200210221 its reverse (12201200202202), we get a palindrome (32421400412423).
The spelling of 20220200210221 in words is "twenty trillion, two hundred twenty billion, two hundred million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •