Base | Representation |
---|---|
bin | 101101101100111100000010… |
… | …001111100010001010010110 |
3 | 222100200102200101011220001021 |
4 | 231230330002033202022112 |
5 | 202321141413300041042 |
6 | 1551254120034151354 |
7 | 60223533430065121 |
oct | 5554740217421226 |
9 | 870612611156037 |
10 | 201000212112022 |
11 | 59054790744134 |
12 | 1a66323042255a |
13 | 882031449299b |
14 | 378c6682c33b8 |
15 | 1838724253867 |
hex | b6cf023e2296 |
201000212112022 has 4 divisors (see below), whose sum is σ = 301500318168036. Its totient is φ = 100500106056010.
The previous prime is 201000212112013. The next prime is 201000212112023. The reversal of 201000212112022 is 220211212000102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 201000212111987 and 201000212112005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201000212112023) 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 as a sum of consecutive naturals, namely, 50250053028004 + ... + 50250053028007.
It is an arithmetic number, because the mean of its divisors is an integer number (75375079542009).
Almost surely, 2201000212112022 is an apocalyptic number.
201000212112022 is a deficient number, since it is larger than the sum of its proper divisors (100500106056014).
201000212112022 is a wasteful number, since it uses less digits than its factorization.
201000212112022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100500106056013.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201000212112022 its reverse (220211212000102), we get a palindrome (421211424112124).
The spelling of 201000212112022 in words is "two hundred one trillion, two hundred twelve million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •