Base | Representation |
---|---|
bin | 10111111111111… |
… | …10011010110000 |
3 | 112000211010021110 |
4 | 23333332122300 |
5 | 403014220422 |
6 | 31550553320 |
7 | 4663123050 |
oct | 1377763260 |
9 | 460733243 |
10 | 201320112 |
11 | a3704864 |
12 | 57508840 |
13 | 3292a136 |
14 | 1ca47560 |
15 | 12a1a60c |
hex | bffe6b0 |
201320112 has 80 divisors (see below), whose sum is σ = 597676032. Its totient is φ = 57200640.
The previous prime is 201320111. The next prime is 201320123. The reversal of 201320112 is 211023102.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (201320111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 62608 + ... + 65744.
Almost surely, 2201320112 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 201320112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (298838016).
201320112 is an abundant number, since it is smaller than the sum of its proper divisors (396355920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201320112 is a wasteful number, since it uses less digits than its factorization.
201320112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3346 (or 3340 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 201320112 is about 14188.7318672248. The cubic root of 201320112 is about 586.0874040167.
Adding to 201320112 its reverse (211023102), we get a palindrome (412343214).
The spelling of 201320112 in words is "two hundred one million, three hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •