Base | Representation |
---|---|
bin | 101101101110011011000010… |
… | …011100111111001110001001 |
3 | 222101001011222120010000110000 |
4 | 231232123002130333032021 |
5 | 202324324322101042301 |
6 | 1551413030205113213 |
7 | 60234104340222033 |
oct | 5556330234771611 |
9 | 871034876100400 |
10 | 201102221112201 |
11 | 59093a78103862 |
12 | 1a67ab5ab58809 |
13 | 8829b2027b216 |
14 | 37935840a2c53 |
15 | 183b1e4a2c786 |
hex | b6e6c273f389 |
201102221112201 has 20 divisors (see below), whose sum is σ = 300412380611200. Its totient is φ = 134067959667576.
The previous prime is 201102221112197. The next prime is 201102221112229. The reversal of 201102221112201 is 102211122201102.
201102221112201 is a `hidden beast` number, since 2 + 0 + 110 + 222 + 111 + 220 + 1 = 666.
It is not a de Polignac number, because 201102221112201 - 22 = 201102221112197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201102221112251) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 80097360 + ... + 82569918.
It is an arithmetic number, because the mean of its divisors is an integer number (15020619030560).
Almost surely, 2201102221112201 is an apocalyptic number.
It is an amenable number.
201102221112201 is a deficient number, since it is larger than the sum of its proper divisors (99310159498999).
201102221112201 is a wasteful number, since it uses less digits than its factorization.
201102221112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3476690 (or 3476681 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 201102221112201 its reverse (102211122201102), we get a palindrome (303313343313303).
The spelling of 201102221112201 in words is "two hundred one trillion, one hundred two billion, two hundred twenty-one million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •