Base | Representation |
---|---|
bin | 101101101110011011111000… |
… | …110100010101001011101100 |
3 | 222101001021100010100221020112 |
4 | 231232123320310111023230 |
5 | 202324333204044414012 |
6 | 1551413300510235152 |
7 | 60234136053650321 |
oct | 5556337064251354 |
9 | 871037303327215 |
10 | 201103133201132 |
11 | 590943a5a42768 |
12 | 1a67b1744b5ab8 |
13 | 8829c37218206 |
14 | 379362d288b48 |
15 | 183b249b46122 |
hex | b6e6f8d152ec |
201103133201132 has 24 divisors (see below), whose sum is σ = 359893820043072. Its totient is φ = 98290328947200.
The previous prime is 201103133201119. The next prime is 201103133201167. The reversal of 201103133201132 is 231102331301102.
It is a junction number, because it is equal to n+sod(n) for n = 201103133201098 and 201103133201107.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1750126469 + ... + 1750241372.
It is an arithmetic number, because the mean of its divisors is an integer number (14995575835128).
Almost surely, 2201103133201132 is an apocalyptic number.
It is an amenable number.
201103133201132 is a deficient number, since it is larger than the sum of its proper divisors (158790686841940).
201103133201132 is a wasteful number, since it uses less digits than its factorization.
201103133201132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3500368169 (or 3500368167 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 201103133201132 its reverse (231102331301102), we get a palindrome (432205464502234).
The spelling of 201103133201132 in words is "two hundred one trillion, one hundred three billion, one hundred thirty-three million, two hundred one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •