Base | Representation |
---|---|
bin | 1011101101001011011… |
… | …1010001101001000100 |
3 | 201020002102210112012121 |
4 | 2323102313101221010 |
5 | 11243331141414111 |
6 | 232215323455324 |
7 | 20346412335160 |
oct | 2732267215104 |
9 | 636072715177 |
10 | 201106201156 |
11 | 7831a231533 |
12 | 32b86087544 |
13 | 15c6c561583 |
14 | 9a3ad95ca0 |
15 | 5370632871 |
hex | 2ed2dd1a44 |
201106201156 has 12 divisors (see below), whose sum is σ = 402212402368. Its totient is φ = 86188371912.
The previous prime is 201106201147. The next prime is 201106201253. The reversal of 201106201156 is 651102601102.
It is a happy number.
201106201156 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
201106201156 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 201106201156.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 3591182136 + ... + 3591182191.
Almost surely, 2201106201156 is an apocalyptic number.
It is an amenable number.
201106201156 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201106201156 is a wasteful number, since it uses less digits than its factorization.
201106201156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7182364338 (or 7182364336 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 25.
Adding to 201106201156 its reverse (651102601102), we get a palindrome (852208802258).
The spelling of 201106201156 in words is "two hundred one billion, one hundred six million, two hundred one thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •