Base | Representation |
---|---|
bin | 1010111011001000100000… |
… | …0111011010001110110001 |
3 | 1120112020112002111000000011 |
4 | 2232302020013122032301 |
5 | 3033242023111002231 |
6 | 41313441031454521 |
7 | 2346524036132626 |
oct | 256621007321661 |
9 | 46466462430004 |
10 | 12011012203441 |
11 | 3910929298289 |
12 | 141b993827441 |
13 | 691830cca9b4 |
14 | 2d749c34834d |
15 | 15c679ac09b1 |
hex | aec881da3b1 |
12011012203441 has 4 divisors (see below), whose sum is σ = 12014860656484. Its totient is φ = 12007163750400.
The previous prime is 12011012203427. The next prime is 12011012203457. The reversal of 12011012203441 is 14430221011021.
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 3016387400625 + 8994624802816 = 1736775^2 + 2999104^2 .
It is a cyclic number.
It is not a de Polignac number, because 12011012203441 - 213 = 12011012195249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12011012203241) 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, 1924221840 + ... + 1924228081.
It is an arithmetic number, because the mean of its divisors is an integer number (3003715164121).
Almost surely, 212011012203441 is an apocalyptic number.
It is an amenable number.
12011012203441 is a deficient number, since it is larger than the sum of its proper divisors (3848453043).
12011012203441 is an equidigital number, since it uses as much as digits as its factorization.
12011012203441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3848453042.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 12011012203441 its reverse (14430221011021), we get a palindrome (26441233214462).
The spelling of 12011012203441 in words is "twelve trillion, eleven billion, twelve million, two hundred three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •