Base | Representation |
---|---|
bin | 1010000110110000100100… |
… | …0111000001100101100001 |
3 | 1110100020000221121021212011 |
4 | 2201230021013001211201 |
5 | 2424021301201344301 |
6 | 35344232521432521 |
7 | 2224521501066115 |
oct | 241541107014541 |
9 | 43306027537764 |
10 | 11111233231201 |
11 | 35a427a542964 |
12 | 12b552163b741 |
13 | 627a2827c05c |
14 | 2a5b02459745 |
15 | 144066ba3a51 |
hex | a1b091c1961 |
11111233231201 has 8 divisors (see below), whose sum is σ = 11121114875904. Its totient is φ = 11101351984800.
The previous prime is 11111233231177. The next prime is 11111233231223. The reversal of 11111233231201 is 10213233211111.
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 11111233231201 - 229 = 11110696360289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11111233291201) 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 7 ways as a sum of consecutive naturals, for example, 99916836 + ... + 100027978.
It is an arithmetic number, because the mean of its divisors is an integer number (1390139359488).
Almost surely, 211111233231201 is an apocalyptic number.
It is an amenable number.
11111233231201 is a deficient number, since it is larger than the sum of its proper divisors (9881644703).
11111233231201 is a wasteful number, since it uses less digits than its factorization.
11111233231201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199151.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 11111233231201 its reverse (10213233211111), we get a palindrome (21324466442312).
The spelling of 11111233231201 in words is "eleven trillion, one hundred eleven billion, two hundred thirty-three million, two hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •