Base | Representation |
---|---|
bin | 1010111011110101001011… |
… | …0101011110010101101001 |
3 | 1120120101110202200022012102 |
4 | 2232331102311132111221 |
5 | 3033441102310223423 |
6 | 41323142540423145 |
7 | 2350430141044646 |
oct | 256752265362551 |
9 | 46511422608172 |
10 | 12023003211113 |
11 | 3915a21967884 |
12 | 142217b547ab5 |
13 | 6929c23344cb |
14 | 2d7cb8aa4dcd |
15 | 15cb2c666c28 |
hex | aef52d5e569 |
12023003211113 has 4 divisors (see below), whose sum is σ = 12032770071168. Its totient is φ = 12013236351060.
The previous prime is 12023003211097. The next prime is 12023003211133. The reversal of 12023003211113 is 31111230032021.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12023003211113 - 24 = 12023003211097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12023003211133) 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, 4883428181 + ... + 4883430642.
It is an arithmetic number, because the mean of its divisors is an integer number (3008192517792).
Almost surely, 212023003211113 is an apocalyptic number.
It is an amenable number.
12023003211113 is a deficient number, since it is larger than the sum of its proper divisors (9766860055).
12023003211113 is an equidigital number, since it uses as much as digits as its factorization.
12023003211113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9766860054.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12023003211113 its reverse (31111230032021), we get a palindrome (43134233243134).
The spelling of 12023003211113 in words is "twelve trillion, twenty-three billion, three million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •