Base | Representation |
---|---|
bin | 10111111101101… |
… | …01101010010101 |
3 | 112000020222111000 |
4 | 23332311222111 |
5 | 402430201401 |
6 | 31540333513 |
7 | 4660442160 |
oct | 1376655225 |
9 | 460228430 |
10 | 201022101 |
11 | a3520975 |
12 | 573a4299 |
13 | 328545b7 |
14 | 1c9aaad7 |
15 | 129ac186 |
hex | bfb5a95 |
201022101 has 16 divisors (see below), whose sum is σ = 340355200. Its totient is φ = 114869664.
The previous prime is 201022079. The next prime is 201022103. The reversal of 201022101 is 101220102.
It is not a de Polignac number, because 201022101 - 25 = 201022069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201022103) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 531616 + ... + 531993.
It is an arithmetic number, because the mean of its divisors is an integer number (21272200).
Almost surely, 2201022101 is an apocalyptic number.
201022101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
201022101 is a deficient number, since it is larger than the sum of its proper divisors (139333099).
201022101 is a wasteful number, since it uses less digits than its factorization.
201022101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1063625 (or 1063619 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 201022101 is about 14178.2262995059. The cubic root of 201022101 is about 585.7980692106.
Adding to 201022101 its reverse (101220102), we get a palindrome (302242203).
It can be divided in two parts, 20 and 1022101, that added together give a square (1022121 = 10112).
The spelling of 201022101 in words is "two hundred one million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •