Base | Representation |
---|---|
bin | 1011000111010111001001… |
… | …1100110110000000111111 |
3 | 1121021022210121201121100202 |
4 | 2301311302130312000333 |
5 | 3100212304120333043 |
6 | 41554144035514115 |
7 | 2400642206022155 |
oct | 261656234660077 |
9 | 47238717647322 |
10 | 12221102121023 |
11 | 3991a385a8944 |
12 | 145464645893b |
13 | 6a85a282a8b3 |
14 | 30370c4b73d5 |
15 | 162d73c651b8 |
hex | b1d7273603f |
12221102121023 has 4 divisors (see below), whose sum is σ = 12403506630360. Its totient is φ = 12038697611688.
The previous prime is 12221102121017. The next prime is 12221102121047. The reversal of 12221102121023 is 32012120112221.
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 12221102121023 - 218 = 12221101858879 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12221102120986 and 12221102121004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12221102121073) 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, 91202254568 + ... + 91202254701.
It is an arithmetic number, because the mean of its divisors is an integer number (3100876657590).
Almost surely, 212221102121023 is an apocalyptic number.
12221102121023 is a deficient number, since it is larger than the sum of its proper divisors (182404509337).
12221102121023 is an equidigital number, since it uses as much as digits as its factorization.
12221102121023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182404509336.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 12221102121023 its reverse (32012120112221), we get a palindrome (44233222233244).
The spelling of 12221102121023 in words is "twelve trillion, two hundred twenty-one billion, one hundred two million, one hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •