Base | Representation |
---|---|
bin | 10111111111110… |
… | …11001110011000 |
3 | 112000210110100000 |
4 | 23333323032120 |
5 | 403013311112 |
6 | 31550413000 |
7 | 4663036653 |
oct | 1377731630 |
9 | 460713300 |
10 | 201307032 |
11 | a36a5a53 |
12 | 57501160 |
13 | 329241b4 |
14 | 1ca4289a |
15 | 12a167dc |
hex | bffb398 |
201307032 has 48 divisors (see below), whose sum is σ = 565404840. Its totient is φ = 67101696.
The previous prime is 201307031. The next prime is 201307049. The reversal of 201307032 is 230703102.
It is a super-2 number, since 2×2013070322 = 81049042265298048, which contains 22 as substring.
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 = 201306996 and 201307014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201307031) 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 11 ways as a sum of consecutive naturals, for example, 49833 + ... + 53720.
Almost surely, 2201307032 is an apocalyptic number.
It is an amenable number.
201307032 is an abundant number, since it is smaller than the sum of its proper divisors (364097808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201307032 is a wasteful number, since it uses less digits than its factorization.
201307032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103574 (or 103558 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 18.
The square root of 201307032 is about 14188.2709305962. The cubic root of 201307032 is about 586.0747108168.
It can be divided in two parts, 2013070 and 32, that added together give a palindrome (2013102).
The spelling of 201307032 in words is "two hundred one million, three hundred seven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •