Base | Representation |
---|---|
bin | 1010111011001000110101… |
… | …0110010111011011011001 |
3 | 1120112020202012201001020101 |
4 | 2232302031112113123121 |
5 | 3033242213100311301 |
6 | 41313453445455401 |
7 | 2346526153362205 |
oct | 256621526273331 |
9 | 46466665631211 |
10 | 12011100010201 |
11 | 3910973910856 |
12 | 141b9b9111561 |
13 | 691846262566 |
14 | 2d74a9c83b05 |
15 | 15c682667701 |
hex | aec8d5976d9 |
12011100010201 has 4 divisors (see below), whose sum is σ = 12018602260404. Its totient is φ = 12003597760000.
The previous prime is 12011100010181. The next prime is 12011100010211. The reversal of 12011100010201 is 10201000111021.
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 8124346904976 + 3886753105225 = 2850324^2 + 1971485^2 .
It is a cyclic number.
It is not a de Polignac number, because 12011100010201 - 223 = 12011091621593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12011100010211) 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, 3751122700 + ... + 3751125901.
It is an arithmetic number, because the mean of its divisors is an integer number (3004650565101).
Almost surely, 212011100010201 is an apocalyptic number.
It is an amenable number.
12011100010201 is a deficient number, since it is larger than the sum of its proper divisors (7502250203).
12011100010201 is an equidigital number, since it uses as much as digits as its factorization.
12011100010201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7502250202.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 12011100010201 its reverse (10201000111021), we get a palindrome (22212100121222).
The spelling of 12011100010201 in words is "twelve trillion, eleven billion, one hundred million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •