Base | Representation |
---|---|
bin | 10111111110011… |
… | …00000110101110 |
3 | 112000102122120210 |
4 | 23333030012232 |
5 | 402441122110 |
6 | 31542323250 |
7 | 4661304165 |
oct | 1377140656 |
9 | 460378523 |
10 | 201114030 |
11 | a3583a47 |
12 | 57429526 |
13 | 328873b0 |
14 | 1c9d23dc |
15 | 129c9520 |
hex | bfcc1ae |
201114030 has 32 divisors (see below), whose sum is σ = 519803424. Its totient is φ = 49504896.
The previous prime is 201113971. The next prime is 201114037. The reversal of 201114030 is 30411102.
It is a happy number.
201114030 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201113997 and 201114015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201114037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 257449 + ... + 258228.
It is an arithmetic number, because the mean of its divisors is an integer number (16243857).
Almost surely, 2201114030 is an apocalyptic number.
201114030 is an abundant number, since it is smaller than the sum of its proper divisors (318689394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201114030 is a wasteful number, since it uses less digits than its factorization.
201114030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 515700.
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 201114030 is about 14181.4678365817. The cubic root of 201114030 is about 585.8873523020.
Adding to 201114030 its reverse (30411102), we get a palindrome (231525132).
The spelling of 201114030 in words is "two hundred one million, one hundred fourteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •