Base | Representation |
---|---|
bin | 101111110011000111101010… |
… | …100110010000101100001101 |
3 | 1000120022221102121201022202020 |
4 | 233303013222212100230031 |
5 | 210023230313202413401 |
6 | 2023034124513320353 |
7 | 62164655040453666 |
oct | 5763075246205415 |
9 | 1016287377638666 |
10 | 210221110201101 |
11 | 60a8a2aa28a05a |
12 | 1b6b23145660b9 |
13 | 903b9c512410c |
14 | 39caa8275236d |
15 | 19485008c0d36 |
hex | bf31ea990b0d |
210221110201101 has 16 divisors (see below), whose sum is σ = 280329350440896. Its totient is φ = 140130139124096.
The previous prime is 210221110201097. The next prime is 210221110201133. The reversal of 210221110201101 is 101102011122012.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 210221110201101 - 22 = 210221110201097 is a prime.
It is a super-2 number, since 2×2102211102011012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210221110206101) 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, 1793590966 + ... + 1793708168.
It is an arithmetic number, because the mean of its divisors is an integer number (17520584402556).
Almost surely, 2210221110201101 is an apocalyptic number.
It is an amenable number.
210221110201101 is a deficient number, since it is larger than the sum of its proper divisors (70108240239795).
210221110201101 is a wasteful number, since it uses less digits than its factorization.
210221110201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185772.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 210221110201101 its reverse (101102011122012), we get a palindrome (311323121323113).
The spelling of 210221110201101 in words is "two hundred ten trillion, two hundred twenty-one billion, one hundred ten million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •