Base | Representation |
---|---|
bin | 10111111110000… |
… | …01111001011110 |
3 | 112000100112020100 |
4 | 23333001321132 |
5 | 402433302342 |
6 | 31541401530 |
7 | 4661041251 |
oct | 1377017136 |
9 | 460315210 |
10 | 201072222 |
11 | a355559a |
12 | 574092a6 |
13 | 32871360 |
14 | 1c9c1098 |
15 | 129bbe4c |
hex | bfc1e5e |
201072222 has 96 divisors (see below), whose sum is σ = 484848000. Its totient is φ = 59844096.
The previous prime is 201072217. The next prime is 201072229. The reversal of 201072222 is 222270102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 201072195 and 201072204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201072229) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1349404 + ... + 1349552.
It is an arithmetic number, because the mean of its divisors is an integer number (5050500).
Almost surely, 2201072222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201072222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (242424000).
201072222 is an abundant number, since it is smaller than the sum of its proper divisors (283775778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201072222 is a wasteful number, since it uses less digits than its factorization.
201072222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 322 (or 319 counting only the distinct ones).
The product of its (nonzero) digits is 224, while the sum is 18.
The square root of 201072222 is about 14179.9937235529. The cubic root of 201072222 is about 585.8467509974.
The spelling of 201072222 in words is "two hundred one million, seventy-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •