Base | Representation |
---|---|
bin | 1011101100110111001… |
… | …0101001001111011101 |
3 | 201012212111122222202202 |
4 | 2323031302221033131 |
5 | 11243142400213041 |
6 | 232203043501245 |
7 | 20344330110626 |
oct | 2731562511735 |
9 | 635774588682 |
10 | 201021101021 |
11 | 78286197544 |
12 | 32b61687825 |
13 | 15c57a36970 |
14 | 9a2d962a4d |
15 | 5367e22a9b |
hex | 2ecdca93dd |
201021101021 has 8 divisors (see below), whose sum is σ = 219224570880. Its totient is φ = 183209103792.
The previous prime is 201021100979. The next prime is 201021101027. The reversal of 201021101021 is 120101120102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-201021101021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201021100993 and 201021101011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201021101027) 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, 97867085 + ... + 97869138.
It is an arithmetic number, because the mean of its divisors is an integer number (27403071360).
Almost surely, 2201021101021 is an apocalyptic number.
It is an amenable number.
201021101021 is a deficient number, since it is larger than the sum of its proper divisors (18203469859).
201021101021 is a wasteful number, since it uses less digits than its factorization.
201021101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195736315.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 201021101021 its reverse (120101120102), we get a palindrome (321122221123).
The spelling of 201021101021 in words is "two hundred one billion, twenty-one million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •