Base | Representation |
---|---|
bin | 1010111011001001001101… |
… | …1000001100111111110001 |
3 | 1120112021000021000201220011 |
4 | 2232302103120030333301 |
5 | 3033242414443430212 |
6 | 41313511501414521 |
7 | 2346531522163156 |
oct | 256622330147761 |
9 | 46467007021804 |
10 | 12011201155057 |
11 | 3910a15a14445 |
12 | 141ba26b6a441 |
13 | 6918611b71a0 |
14 | 2d74b949222d |
15 | 15c68b4964a7 |
hex | aec9360cff1 |
12011201155057 has 8 divisors (see below), whose sum is σ = 12935193155136. Its totient is φ = 11087216790672.
The previous prime is 12011201155043. The next prime is 12011201155091. The reversal of 12011201155057 is 75055110211021.
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 12011201155057 - 231 = 12009053671409 is a prime.
It is a super-2 number, since 2×120112011550572 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12011201155027) 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, 1596588 + ... + 5154754.
It is an arithmetic number, because the mean of its divisors is an integer number (1616899144392).
Almost surely, 212011201155057 is an apocalyptic number.
It is an amenable number.
12011201155057 is a deficient number, since it is larger than the sum of its proper divisors (923992000079).
12011201155057 is a wasteful number, since it uses less digits than its factorization.
12011201155057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3817847.
The product of its (nonzero) digits is 3500, while the sum is 31.
Adding to 12011201155057 its reverse (75055110211021), we get a palindrome (87066311366078).
The spelling of 12011201155057 in words is "twelve trillion, eleven billion, two hundred one million, one hundred fifty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •