Base | Representation |
---|---|
bin | 101101101101010000010101… |
… | …100100000111011100101010 |
3 | 222100202111221120211210020120 |
4 | 231231100111210013130222 |
5 | 202322021034321024320 |
6 | 1551312123110304110 |
7 | 60225234555400452 |
oct | 5555202544073452 |
9 | 870674846753216 |
10 | 201022011111210 |
11 | 59062a57703943 |
12 | 1a6674b4958036 |
13 | 88223a9799c83 |
14 | 378d7354a0d62 |
15 | 183909cdcb440 |
hex | b6d41590772a |
201022011111210 has 32 divisors (see below), whose sum is σ = 495492092255232. Its totient is φ = 52157062342080.
The previous prime is 201022011111209. The next prime is 201022011111239. The reversal of 201022011111210 is 12111110220102.
It is a happy number.
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 201022011111210.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 90550454346 + ... + 90550456565.
It is an arithmetic number, because the mean of its divisors is an integer number (15484127882976).
Almost surely, 2201022011111210 is an apocalyptic number.
201022011111210 is an abundant number, since it is smaller than the sum of its proper divisors (294470081144022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201022011111210 is a wasteful number, since it uses less digits than its factorization.
201022011111210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181100910958.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 201022011111210 its reverse (12111110220102), we get a palindrome (213133121331312).
The spelling of 201022011111210 in words is "two hundred one trillion, twenty-two billion, eleven million, one hundred eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •