Base | Representation |
---|---|
bin | 1100111000000111000… |
… | …0000110001010001101 |
3 | 210011000012211120222112 |
4 | 3032001300012022031 |
5 | 12111024332413401 |
6 | 245343244353405 |
7 | 21661020453344 |
oct | 3160160061215 |
9 | 704005746875 |
10 | 221220201101 |
11 | 85901044389 |
12 | 36a5a245865 |
13 | 17b267420a3 |
14 | a9c8474b5b |
15 | 5b4b3bb3bb |
hex | 3381c0628d |
221220201101 has 24 divisors (see below), whose sum is σ = 239349915000. Its totient is φ = 204312222720.
The previous prime is 221220201071. The next prime is 221220201143. The reversal of 221220201101 is 101102022122.
It can be written as a sum of positive squares in 4 ways, for example, as 8561800900 + 212658400201 = 92530^2 + 461149^2 .
It is a de Polignac number, because none of the positive numbers 2k-221220201101 is a prime.
It is a super-2 number, since 2×2212202011012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221220201701) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22921925 + ... + 22931573.
It is an arithmetic number, because the mean of its divisors is an integer number (9972913125).
Almost surely, 2221220201101 is an apocalyptic number.
It is an amenable number.
221220201101 is a deficient number, since it is larger than the sum of its proper divisors (18129713899).
221220201101 is a wasteful number, since it uses less digits than its factorization.
221220201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11277 (or 11258 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 221220201101 its reverse (101102022122), we get a palindrome (322322223223).
The spelling of 221220201101 in words is "two hundred twenty-one billion, two hundred twenty million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •