Base | Representation |
---|---|
bin | 10111111110010… |
… | …01010001000000 |
3 | 112000102001122001 |
4 | 23333021101000 |
5 | 402440234100 |
6 | 31542153344 |
7 | 4661225242 |
oct | 1377112100 |
9 | 460361561 |
10 | 201102400 |
11 | a3576234 |
12 | 57422854 |
13 | 32882005 |
14 | 1c9cc092 |
15 | 129c5d6a |
hex | bfc9440 |
201102400 has 168 divisors, whose sum is σ = 526613120. Its totient is φ = 75479040.
The previous prime is 201102379. The next prime is 201102431. The reversal of 201102400 is 4201102.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2545561 + ... + 2545639.
Almost surely, 2201102400 is an apocalyptic number.
201102400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201102400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (263306560).
201102400 is an abundant number, since it is smaller than the sum of its proper divisors (325510720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201102400 is a wasteful number, since it uses less digits than its factorization.
201102400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181 (or 166 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
The square root of 201102400 is about 14181.0577884726. The cubic root of 201102400 is about 585.8760585412.
Adding to 201102400 its reverse (4201102), we get a palindrome (205303502).
The spelling of 201102400 in words is "two hundred one million, one hundred two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •