Base | Representation |
---|---|
bin | 101101110000001000111011… |
… | …001100101100011010110100 |
3 | 222101110110112110220101202220 |
4 | 231300020323030230122310 |
5 | 202333242443004013022 |
6 | 1551543142214002340 |
7 | 60245452260561000 |
oct | 5560107314543264 |
9 | 871413473811686 |
10 | 201220211001012 |
11 | 5912a015345665 |
12 | 1a6999a96463b0 |
13 | 8837ca4b8ab88 |
14 | 379917847b700 |
15 | 183e2ed2c485c |
hex | b7023b32c6b4 |
201220211001012 has 96 divisors (see below), whose sum is σ = 547575098515200. Its totient is φ = 57487592373120.
The previous prime is 201220211000987. The next prime is 201220211001041. The reversal of 201220211001012 is 210100112022102.
It is a junction number, because it is equal to n+sod(n) for n = 201220211000982 and 201220211001000.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 59353978 + ... + 62652494.
It is an arithmetic number, because the mean of its divisors is an integer number (5703907276200).
Almost surely, 2201220211001012 is an apocalyptic number.
It is an amenable number.
201220211001012 is an abundant number, since it is smaller than the sum of its proper divisors (346354887514188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201220211001012 is a wasteful number, since it uses less digits than its factorization.
201220211001012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3313366 (or 3313350 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201220211001012 its reverse (210100112022102), we get a palindrome (411320323023114).
The spelling of 201220211001012 in words is "two hundred one trillion, two hundred twenty billion, two hundred eleven million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •