Base | Representation |
---|---|
bin | 1010011110100011110010… |
… | …1010100001001100101011 |
3 | 1111210022102222022200120101 |
4 | 2213220330222201030223 |
5 | 3002221201214114414 |
6 | 40300134201410231 |
7 | 2266205212620025 |
oct | 247507452411453 |
9 | 44708388280511 |
10 | 11520120066859 |
11 | 37417234a3438 |
12 | 1360814a99977 |
13 | 65745ba97c21 |
14 | 2bb8109b7015 |
15 | 14e9e8873a74 |
hex | a7a3caa132b |
11520120066859 has 8 divisors (see below), whose sum is σ = 11523568861728. Its totient is φ = 11516671685760.
The previous prime is 11520120066853. The next prime is 11520120066869. The reversal of 11520120066859 is 95866002102511.
11520120066859 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11520120066859 - 217 = 11520119935787 is a prime.
It is a super-3 number, since 3×115201200668593 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11520120066853) 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, 60872409 + ... + 61061365.
It is an arithmetic number, because the mean of its divisors is an integer number (1440446107716).
Almost surely, 211520120066859 is an apocalyptic number.
11520120066859 is a deficient number, since it is larger than the sum of its proper divisors (3448794869).
11520120066859 is a wasteful number, since it uses less digits than its factorization.
11520120066859 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 206885.
The product of its (nonzero) digits is 259200, while the sum is 46.
The spelling of 11520120066859 in words is "eleven trillion, five hundred twenty billion, one hundred twenty million, sixty-six thousand, eight hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •