Base | Representation |
---|---|
bin | 101101101111110110001100… |
… | …011111110001100110111110 |
3 | 222101101112121220201211202212 |
4 | 231233312030133301212332 |
5 | 202332430301112333042 |
6 | 1551530014444020422 |
7 | 60244141021115552 |
oct | 5557661437614676 |
9 | 871345556654685 |
10 | 201200100121022 |
11 | 59121535273892 |
12 | 1a695b16531712 |
13 | 883611b5304a2 |
14 | 37981cb571862 |
15 | 183da22955482 |
hex | b6fd8c7f19be |
201200100121022 has 8 divisors (see below), whose sum is σ = 317684368612200. Its totient is φ = 95305310583624.
The previous prime is 201200100121021. The next prime is 201200100121037. The reversal of 201200100121022 is 220121001002102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 201200100120988 and 201200100121006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201200100121021) 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 3 ways as a sum of consecutive naturals, for example, 2647369738397 + ... + 2647369738472.
It is an arithmetic number, because the mean of its divisors is an integer number (39710546076525).
Almost surely, 2201200100121022 is an apocalyptic number.
201200100121022 is a deficient number, since it is larger than the sum of its proper divisors (116484268491178).
201200100121022 is a wasteful number, since it uses less digits than its factorization.
201200100121022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5294739476890.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201200100121022 its reverse (220121001002102), we get a palindrome (421321101123124).
The spelling of 201200100121022 in words is "two hundred one trillion, two hundred billion, one hundred million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •