Base | Representation |
---|---|
bin | 10000000010100000010… |
… | …011001101111100111101 |
3 | 10220100222021200011212012 |
4 | 100002200103031330331 |
5 | 121024301430121341 |
6 | 2202202201021005 |
7 | 142426366043060 |
oct | 20024023157475 |
9 | 3810867604765 |
10 | 1102201020221 |
11 | 395493818074 |
12 | 159744a84765 |
13 | 7cc24aa60c2 |
14 | 3b4bd92c8d7 |
15 | 1da0dd200eb |
hex | 100a04cdf3d |
1102201020221 has 16 divisors (see below), whose sum is σ = 1267056743040. Its totient is φ = 939197918400.
The previous prime is 1102201020191. The next prime is 1102201020223. The reversal of 1102201020221 is 1220201022011.
It is not a de Polignac number, because 1102201020221 - 234 = 1085021151037 is a prime.
It is a super-4 number, since 4×11022010202214 (a number of 49 digits) contains 4444 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1102201020196 and 1102201020205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102201020223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4333271 + ... + 4580571.
It is an arithmetic number, because the mean of its divisors is an integer number (79191046440).
Almost surely, 21102201020221 is an apocalyptic number.
It is an amenable number.
1102201020221 is a deficient number, since it is larger than the sum of its proper divisors (164855722819).
1102201020221 is a wasteful number, since it uses less digits than its factorization.
1102201020221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 251044.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1102201020221 its reverse (1220201022011), we get a palindrome (2322402042232).
The spelling of 1102201020221 in words is "one trillion, one hundred two billion, two hundred one million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •