Base | Representation |
---|---|
bin | 1010111011001000100011… |
… | …0000101011010010011011 |
3 | 1120112020112211211121012022 |
4 | 2232302020300223102123 |
5 | 3033242033343134321 |
6 | 41313442055405055 |
7 | 2346524230106414 |
oct | 256621060532233 |
9 | 46466484747168 |
10 | 12011023021211 |
11 | 3910934406895 |
12 | 141b99738378b |
13 | 691833317846 |
14 | 2d749d96280b |
15 | 15c67aa0adab |
hex | aec88c2b49b |
12011023021211 has 4 divisors (see below), whose sum is σ = 12013252657752. Its totient is φ = 12008793384672.
The previous prime is 12011023021157. The next prime is 12011023021219. The reversal of 12011023021211 is 11212032011021.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12011023021211 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12011023021211.
It is not an unprimeable number, because it can be changed into a prime (12011023021219) 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, 1114810190 + ... + 1114820963.
It is an arithmetic number, because the mean of its divisors is an integer number (3003313164438).
Almost surely, 212011023021211 is an apocalyptic number.
12011023021211 is a deficient number, since it is larger than the sum of its proper divisors (2229636541).
12011023021211 is an equidigital number, since it uses as much as digits as its factorization.
12011023021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2229636540.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 12011023021211 its reverse (11212032011021), we get a palindrome (23223055032232).
The spelling of 12011023021211 in words is "twelve trillion, eleven billion, twenty-three million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •