Base | Representation |
---|---|
bin | 101101101111111000001010… |
… | …010000110010010100101001 |
3 | 222101101202001222001221121020 |
4 | 231233320022100302110221 |
5 | 202332444111242333001 |
6 | 1551531004100403053 |
7 | 60244244221612155 |
oct | 5557701220622451 |
9 | 871352058057536 |
10 | 201202210121001 |
11 | 59122418312021 |
12 | 1a6964050a6489 |
13 | 883639670cb9b |
14 | 379834b8a2065 |
15 | 183dae7ce5736 |
hex | b6fe0a432529 |
201202210121001 has 32 divisors (see below), whose sum is σ = 283691285584896. Its totient is φ = 126635768064000.
The previous prime is 201202210120991. The next prime is 201202210121123. The reversal of 201202210121001 is 100121012202102.
It is not a de Polignac number, because 201202210121001 - 237 = 201064771167529 is a prime.
It is a super-2 number, since 2×2012022101210012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201202210121401) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 79052865 + ... + 81558321.
It is an arithmetic number, because the mean of its divisors is an integer number (8865352674528).
Almost surely, 2201202210121001 is an apocalyptic number.
It is an amenable number.
201202210121001 is a deficient number, since it is larger than the sum of its proper divisors (82489075463895).
201202210121001 is a wasteful number, since it uses less digits than its factorization.
201202210121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2526593.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201202210121001 its reverse (100121012202102), we get a palindrome (301323222323103).
The spelling of 201202210121001 in words is "two hundred one trillion, two hundred two billion, two hundred ten million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •