Base | Representation |
---|---|
bin | 1010111011001001001111… |
… | …1010000001100101010001 |
3 | 1120112021000212201011221212 |
4 | 2232302103322001211101 |
5 | 3033242424231134301 |
6 | 41313512415425505 |
7 | 2346531660431036 |
oct | 256622372014521 |
9 | 46467025634855 |
10 | 12011210021201 |
11 | 3910a1aa1a736 |
12 | 141ba29b25295 |
13 | 691862c9c921 |
14 | 2d74ba71d38d |
15 | 15c68c1484bb |
hex | aec93e81951 |
12011210021201 has 4 divisors (see below), whose sum is σ = 12717751787172. Its totient is φ = 11304668255232.
The previous prime is 12011210021189. The next prime is 12011210021207. The reversal of 12011210021201 is 10212001211021.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9047823361600 + 2963386659601 = 3007960^2 + 1721449^2 .
It is a cyclic number.
It is not a de Polignac number, because 12011210021201 - 26 = 12011210021137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12011210021207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 353270882960 + ... + 353270882993.
It is an arithmetic number, because the mean of its divisors is an integer number (3179437946793).
Almost surely, 212011210021201 is an apocalyptic number.
It is an amenable number.
12011210021201 is a deficient number, since it is larger than the sum of its proper divisors (706541765971).
12011210021201 is an equidigital number, since it uses as much as digits as its factorization.
12011210021201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 706541765970.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12011210021201 its reverse (10212001211021), we get a palindrome (22223211232222).
The spelling of 12011210021201 in words is "twelve trillion, eleven billion, two hundred ten million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •