Base | Representation |
---|---|
bin | 101101101111110111111111… |
… | …000011100101011100011001 |
3 | 222101101201120212022001100220 |
4 | 231233313333003211130121 |
5 | 202332443220130023001 |
6 | 1551530533302550253 |
7 | 60244236446553102 |
oct | 5557677703453431 |
9 | 871351525261326 |
10 | 201202022111001 |
11 | 5912233117935a |
12 | 1a696372138389 |
13 | 8836366793172 |
14 | 37983309213a9 |
15 | 183dad6558c36 |
hex | b6fdff0e5719 |
201202022111001 has 16 divisors (see below), whose sum is σ = 284064521330304. Its totient is φ = 126237913691904.
The previous prime is 201202022110979. The next prime is 201202022111009. The reversal of 201202022111001 is 100111220202102.
It is not a de Polignac number, because 201202022111001 - 26 = 201202022110937 is a prime.
It is a super-3 number, since 3×2012020221110013 (a number of 44 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (201202022111009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 100441270 + ... + 102424863.
It is an arithmetic number, because the mean of its divisors is an integer number (17754032583144).
Almost surely, 2201202022111001 is an apocalyptic number.
It is an amenable number.
201202022111001 is a deficient number, since it is larger than the sum of its proper divisors (82862499219303).
201202022111001 is a wasteful number, since it uses less digits than its factorization.
201202022111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202885600.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201202022111001 its reverse (100111220202102), we get a palindrome (301313242313103).
The spelling of 201202022111001 in words is "two hundred one trillion, two hundred two billion, twenty-two million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •