Base | Representation |
---|---|
bin | 1011101101001010110… |
… | …0101010101110001110 |
3 | 201020002020120020121000 |
4 | 2323102230222232032 |
5 | 11243324433422202 |
6 | 232215144121130 |
7 | 20346346603551 |
oct | 2732254525616 |
9 | 636066506530 |
10 | 201103420302 |
11 | 78318702204 |
12 | 32b851661a6 |
13 | 15c6bac98b5 |
14 | 9a3a870698 |
15 | 537028391c |
hex | 2ed2b2ab8e |
201103420302 has 128 divisors (see below), whose sum is σ = 462305232000. Its totient is φ = 64769725440.
The previous prime is 201103420283. The next prime is 201103420313. The reversal of 201103420302 is 203024301102.
201103420302 is a `hidden beast` number, since 20 + 1 + 1 + 0 + 342 + 0 + 302 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 64682724 + ... + 64685832.
It is an arithmetic number, because the mean of its divisors is an integer number (3611759625).
Almost surely, 2201103420302 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201103420302, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (231152616000).
201103420302 is an abundant number, since it is smaller than the sum of its proper divisors (261201811698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201103420302 is a wasteful number, since it uses less digits than its factorization.
201103420302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3523 (or 3517 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 201103420302 its reverse (203024301102), we get a palindrome (404127721404).
The spelling of 201103420302 in words is "two hundred one billion, one hundred three million, four hundred twenty thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.393 sec. • engine limits •