Base | Representation |
---|---|
bin | 1011101101001010011… |
… | …1101011110011101110 |
3 | 201020002011002212201120 |
4 | 2323102213223303232 |
5 | 11243324120122110 |
6 | 232215100121410 |
7 | 20346332523306 |
oct | 2732247536356 |
9 | 636064085646 |
10 | 201102114030 |
11 | 7831799a844 |
12 | 32b84836266 |
13 | 15c6b76015c |
14 | 9a3a610606 |
15 | 53700c6870 |
hex | 2ed29ebcee |
201102114030 has 128 divisors (see below), whose sum is σ = 499819009536. Its totient is φ = 51754560000.
The previous prime is 201102114019. The next prime is 201102114041. The reversal of 201102114030 is 30411201102.
It is an interprime number because it is at equal distance from previous prime (201102114019) and next prime (201102114041).
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 138594805 + ... + 138596255.
It is an arithmetic number, because the mean of its divisors is an integer number (3904836012).
Almost surely, 2201102114030 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201102114030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (249909504768).
201102114030 is an abundant number, since it is smaller than the sum of its proper divisors (298716895506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201102114030 is a wasteful number, since it uses less digits than its factorization.
201102114030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2882.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 201102114030 its reverse (30411201102), we get a palindrome (231513315132).
The spelling of 201102114030 in words is "two hundred one billion, one hundred two million, one hundred fourteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •