Base | Representation |
---|---|
bin | 101101101110101101011110… |
… | …000101010100000100001001 |
3 | 222101010002001211012100111020 |
4 | 231232231132011110010021 |
5 | 202330140340034133001 |
6 | 1551430102105023053 |
7 | 60235404643165431 |
oct | 5556553605240411 |
9 | 871102054170436 |
10 | 201122012021001 |
11 | 590a1403600535 |
12 | 1a682962a84a89 |
13 | 882b955537846 |
14 | 37945006bb2c1 |
15 | 183b9a2245736 |
hex | b6eb5e154109 |
201122012021001 has 8 divisors (see below), whose sum is σ = 268451340053280. Its totient is φ = 133937012668032.
The previous prime is 201122012020967. The next prime is 201122012021011. The reversal of 201122012021001 is 100120210221102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201122012021001 - 231 = 201119864537353 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201122012021011) 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 7 ways as a sum of consecutive naturals, for example, 36082166575 + ... + 36082172148.
It is an arithmetic number, because the mean of its divisors is an integer number (33556417506660).
Almost surely, 2201122012021001 is an apocalyptic number.
It is an amenable number.
201122012021001 is a deficient number, since it is larger than the sum of its proper divisors (67329328032279).
201122012021001 is an equidigital number, since it uses as much as digits as its factorization.
201122012021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72164339655.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201122012021001 its reverse (100120210221102), we get a palindrome (301242222242103).
The spelling of 201122012021001 in words is "two hundred one trillion, one hundred twenty-two billion, twelve million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •