Base | Representation |
---|---|
bin | 1010001100101111111100… |
… | …0010101010110010101001 |
3 | 1110201001122221111020112210 |
4 | 2203023333002222302221 |
5 | 2432213031221012301 |
6 | 35503412330355333 |
7 | 2235123634160151 |
oct | 243137702526251 |
9 | 43631587436483 |
10 | 11214143532201 |
11 | 36339897431a5 |
12 | 1311461b8bb49 |
13 | 6346489c809c |
14 | 2aaaa5c13761 |
15 | 146a8b664ad6 |
hex | a32ff0aaca9 |
11214143532201 has 8 divisors (see below), whose sum is σ = 14952787252704. Its totient is φ = 7475797749920.
The previous prime is 11214143532197. The next prime is 11214143532209. The reversal of 11214143532201 is 10223534141211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11214143532201 - 22 = 11214143532197 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11214143532209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74396715 + ... + 74547296.
It is an arithmetic number, because the mean of its divisors is an integer number (1869098406588).
Almost surely, 211214143532201 is an apocalyptic number.
It is an amenable number.
11214143532201 is a deficient number, since it is larger than the sum of its proper divisors (3738643720503).
11214143532201 is a wasteful number, since it uses less digits than its factorization.
11214143532201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148969111.
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 11214143532201 its reverse (10223534141211), we get a palindrome (21437677673412).
The spelling of 11214143532201 in words is "eleven trillion, two hundred fourteen billion, one hundred forty-three million, five hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •