Base | Representation |
---|---|
bin | 101101101110110110111101… |
… | …111111110000000110011110 |
3 | 222101011001101121120202210102 |
4 | 231232312331333300012132 |
5 | 202330322232021012202 |
6 | 1551434510122541102 |
7 | 60236215456052603 |
oct | 5556667577600636 |
9 | 871131347522712 |
10 | 201132211110302 |
11 | 590a576773625a |
12 | 1a68492a667792 |
13 | 882c8bc550924 |
14 | 3794bcb0666aa |
15 | 183bd9c82cd02 |
hex | b6edbdff019e |
201132211110302 has 8 divisors (see below), whose sum is σ = 301755445694112. Its totient is φ = 100547062545600.
The previous prime is 201132211110101. The next prime is 201132211110307. The reversal of 201132211110302 is 203011112231102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2011322111103022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201132211110307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9521491574 + ... + 9521512697.
It is an arithmetic number, because the mean of its divisors is an integer number (37719430711764).
Almost surely, 2201132211110302 is an apocalyptic number.
201132211110302 is a deficient number, since it is larger than the sum of its proper divisors (100623234583810).
201132211110302 is a wasteful number, since it uses less digits than its factorization.
201132211110302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19043009554.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 201132211110302 its reverse (203011112231102), we get a palindrome (404143323341404).
The spelling of 201132211110302 in words is "two hundred one trillion, one hundred thirty-two billion, two hundred eleven million, one hundred ten thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •