Base | Representation |
---|---|
bin | 101101101110101100100111… |
… | …110110100111110110010010 |
3 | 222101002222201102012122222220 |
4 | 231232230213312213312102 |
5 | 202330132004130401320 |
6 | 1551425431524241510 |
7 | 60235343254634613 |
oct | 5556544766476622 |
9 | 871088642178886 |
10 | 201121102200210 |
11 | 590a0a86a80725 |
12 | 1a68274a240296 |
13 | 882b83bbb304a |
14 | 3794455925c0a |
15 | 183b94c428e40 |
hex | b6eb27da7d92 |
201121102200210 has 16 divisors (see below), whose sum is σ = 482690645280576. Its totient is φ = 53632293920048.
The previous prime is 201121102200209. The next prime is 201121102200241. The reversal of 201121102200210 is 12002201121102.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 201121102200210.
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, 3352018369974 + ... + 3352018370033.
It is an arithmetic number, because the mean of its divisors is an integer number (30168165330036).
Almost surely, 2201121102200210 is an apocalyptic number.
201121102200210 is an abundant number, since it is smaller than the sum of its proper divisors (281569543080366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201121102200210 is a wasteful number, since it uses less digits than its factorization.
201121102200210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6704036740017.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201121102200210 its reverse (12002201121102), we get a palindrome (213123303321312).
The spelling of 201121102200210 in words is "two hundred one trillion, one hundred twenty-one billion, one hundred two million, two hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •