Base | Representation |
---|---|
bin | 1010011110100011110000… |
… | …0100111000100101110001 |
3 | 1111210022102021202110102122 |
4 | 2213220330010320211301 |
5 | 3002221141202414301 |
6 | 40300133210124025 |
7 | 2266205033020130 |
oct | 247507404704561 |
9 | 44708367673378 |
10 | 11520110201201 |
11 | 37417189751a8 |
12 | 1360811720615 |
13 | 657459a22564 |
14 | 2bb80d569917 |
15 | 14e9e7a7581b |
hex | a7a3c138971 |
11520110201201 has 8 divisors (see below), whose sum is σ = 13166642325120. Its totient is φ = 9873778601088.
The previous prime is 11520110201177. The next prime is 11520110201213. The reversal of 11520110201201 is 10210201102511.
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 11520110201201 - 230 = 11519036459377 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11520110201201.
It is not an unprimeable number, because it can be changed into a prime (11520110201251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50007821 + ... + 50237658.
It is an arithmetic number, because the mean of its divisors is an integer number (1645830290640).
Almost surely, 211520110201201 is an apocalyptic number.
It is an amenable number.
11520110201201 is a deficient number, since it is larger than the sum of its proper divisors (1646532123919).
11520110201201 is a wasteful number, since it uses less digits than its factorization.
11520110201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100261903.
The product of its (nonzero) digits is 40, while the sum is 17.
Adding to 11520110201201 its reverse (10210201102511), we get a palindrome (21730311303712).
The spelling of 11520110201201 in words is "eleven trillion, five hundred twenty billion, one hundred ten million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •