Base | Representation |
---|---|
bin | 1011000110110001111110… |
… | …0010010011111111101111 |
3 | 1121020101001000200202121201 |
4 | 2301230133202103333233 |
5 | 3100031334001023043 |
6 | 41545413412110331 |
7 | 2400136651601512 |
oct | 261543742237757 |
9 | 47211030622551 |
10 | 12211121111023 |
11 | 398878658434a |
12 | 145271b9053a7 |
13 | 6a7671a5bc13 |
14 | 303042a98d79 |
15 | 16298c8a8c4d |
hex | b1b1f893fef |
12211121111023 has 4 divisors (see below), whose sum is σ = 12227917702000. Its totient is φ = 12194324520048.
The previous prime is 12211121110999. The next prime is 12211121111083. The reversal of 12211121111023 is 32011112111221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12211121111023 - 217 = 12211120979951 is a prime.
It is a super-2 number, since 2×122111211110232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12211121111083) 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, 8398294398 + ... + 8398295851.
It is an arithmetic number, because the mean of its divisors is an integer number (3056979425500).
Almost surely, 212211121111023 is an apocalyptic number.
12211121111023 is a deficient number, since it is larger than the sum of its proper divisors (16796590977).
12211121111023 is an equidigital number, since it uses as much as digits as its factorization.
12211121111023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16796590976.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 12211121111023 its reverse (32011112111221), we get a palindrome (44222233222244).
The spelling of 12211121111023 in words is "twelve trillion, two hundred eleven billion, one hundred twenty-one million, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •