Base | Representation |
---|---|
bin | 1010111011001000100000… |
… | …1010011111001101111101 |
3 | 1120112020112010222222210212 |
4 | 2232302020022133031331 |
5 | 3033242023312312201 |
6 | 41313441101042205 |
7 | 2346524046033164 |
oct | 256621012371575 |
9 | 46466463888725 |
10 | 12011013010301 |
11 | 3910929799508 |
12 | 141b993b56365 |
13 | 691831221026 |
14 | 2d749c4b83db |
15 | 15c679bceabb |
hex | aec8829f37d |
12011013010301 has 2 divisors, whose sum is σ = 12011013010302. Its totient is φ = 12011013010300.
The previous prime is 12011013010273. The next prime is 12011013010313. The reversal of 12011013010301 is 10301031011021.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7405332183076 + 4605680827225 = 2721274^2 + 2146085^2 .
It is a cyclic number.
It is not a de Polignac number, because 12011013010301 - 218 = 12011012748157 is a prime.
It is a super-2 number, since 2×120110130103012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12011013010331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005506505150 + 6005506505151.
It is an arithmetic number, because the mean of its divisors is an integer number (6005506505151).
Almost surely, 212011013010301 is an apocalyptic number.
It is an amenable number.
12011013010301 is a deficient number, since it is larger than the sum of its proper divisors (1).
12011013010301 is an equidigital number, since it uses as much as digits as its factorization.
12011013010301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 12011013010301 its reverse (10301031011021), we get a palindrome (22312044021322).
The spelling of 12011013010301 in words is "twelve trillion, eleven billion, thirteen million, ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •