Base | Representation |
---|---|
bin | 101101101110011011000001… |
… | …110111001101111111001010 |
3 | 222101001011221212110222211122 |
4 | 231232123001313031333022 |
5 | 202324324312032224320 |
6 | 1551413025212555242 |
7 | 60234104160114131 |
oct | 5556330167157712 |
9 | 871034855428748 |
10 | 201102211211210 |
11 | 59093a72561021 |
12 | 1a67ab57782b22 |
13 | 8829b1b1c274a |
14 | 3793582a46918 |
15 | 183b1e3c23d25 |
hex | b6e6c1dcdfca |
201102211211210 has 16 divisors (see below), whose sum is σ = 363859544847816. Its totient is φ = 80024092336128.
The previous prime is 201102211211183. The next prime is 201102211211219. The reversal of 201102211211210 is 12112112201102.
It can be written as a sum of positive squares in 4 ways, for example, as 96785791452529 + 104316419758681 = 9837977^2 + 10213541^2 .
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (201102211211219) by changing a digit.
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, 52099016519 + ... + 52099020378.
Almost surely, 2201102211211210 is an apocalyptic number.
201102211211210 is a deficient number, since it is larger than the sum of its proper divisors (162757333636606).
201102211211210 is a wasteful number, since it uses less digits than its factorization.
201102211211210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104198037097.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 201102211211210 its reverse (12112112201102), we get a palindrome (213214323412312).
The spelling of 201102211211210 in words is "two hundred one trillion, one hundred two billion, two hundred eleven million, two hundred eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •