Base | Representation |
---|---|
bin | 101101101110011010111011… |
… | …010011101000111101011100 |
3 | 222101001011200012111220221000 |
4 | 231232122323103220331130 |
5 | 202324324100403034322 |
6 | 1551413010243310300 |
7 | 60234101353163442 |
oct | 5556327323507534 |
9 | 871034605456830 |
10 | 201102101221212 |
11 | 59093a164669a4 |
12 | 1a67ab2697b390 |
13 | 8829b01491ac9 |
14 | 37935721b4b92 |
15 | 183b1d92493ac |
hex | b6e6bb4e8f5c |
201102101221212 has 24 divisors (see below), whose sum is σ = 521375817981200. Its totient is φ = 67034033740368.
The previous prime is 201102101221193. The next prime is 201102101221237. The reversal of 201102101221212 is 212122101201102.
201102101221212 is a `hidden beast` number, since 20 + 1 + 1 + 0 + 210 + 1 + 221 + 212 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 931028246287 + ... + 931028246502.
Almost surely, 2201102101221212 is an apocalyptic number.
It is an amenable number.
201102101221212 is an abundant number, since it is smaller than the sum of its proper divisors (320273716759988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201102101221212 is a wasteful number, since it uses less digits than its factorization.
201102101221212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1862056492802 (or 1862056492794 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 201102101221212 its reverse (212122101201102), we get a palindrome (413224202422314).
The spelling of 201102101221212 in words is "two hundred one trillion, one hundred two billion, one hundred one million, two hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •