Base | Representation |
---|---|
bin | 10111111111101… |
… | …10000010100000 |
3 | 112000202101012100 |
4 | 23333312002200 |
5 | 403012121132 |
6 | 31550130400 |
7 | 4662621021 |
oct | 1377660240 |
9 | 460671170 |
10 | 201285792 |
11 | a3690aa4 |
12 | 574b0a00 |
13 | 32917626 |
14 | 1ca38c48 |
15 | 12a1037c |
hex | bff60a0 |
201285792 has 72 divisors (see below), whose sum is σ = 574741440. Its totient is φ = 66821760.
The previous prime is 201285779. The next prime is 201285803. The reversal of 201285792 is 297582102.
It is a tau number, because it is divible by the number of its divisors (72).
It is a super-2 number, since 2×2012857922 = 81031940122134528, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 76759 + ... + 79337.
It is an arithmetic number, because the mean of its divisors is an integer number (7982520).
Almost surely, 2201285792 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201285792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (287370720).
201285792 is an abundant number, since it is smaller than the sum of its proper divisors (373455648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201285792 is a wasteful number, since it uses less digits than its factorization.
201285792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2866 (or 2855 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The square root of 201285792 is about 14187.5224052687. The cubic root of 201285792 is about 586.0540977520.
The spelling of 201285792 in words is "two hundred one million, two hundred eighty-five thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •