Base | Representation |
---|---|
bin | 1011000010101001011100… |
… | …0000010100100010001111 |
3 | 1120222120202012200111101211 |
4 | 2300222113000110202033 |
5 | 3042400421410202343 |
6 | 41453031235315251 |
7 | 2362044161031532 |
oct | 260522700244217 |
9 | 46876665614354 |
10 | 12140111022223 |
11 | 39606571a8648 |
12 | 1440a0274bb27 |
13 | 6a0a662842b2 |
14 | 2dd827c6aa19 |
15 | 160bd377279d |
hex | b0a9701488f |
12140111022223 has 4 divisors (see below), whose sum is σ = 12345875615880. Its totient is φ = 11934346428568.
The previous prime is 12140111022211. The next prime is 12140111022283. The reversal of 12140111022223 is 32222011104121.
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-12140111022223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12140111022194 and 12140111022203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12140111022283) 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, 102882296740 + ... + 102882296857.
It is an arithmetic number, because the mean of its divisors is an integer number (3086468903970).
Almost surely, 212140111022223 is an apocalyptic number.
12140111022223 is a deficient number, since it is larger than the sum of its proper divisors (205764593657).
12140111022223 is an equidigital number, since it uses as much as digits as its factorization.
12140111022223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 205764593656.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 12140111022223 its reverse (32222011104121), we get a palindrome (44362122126344).
The spelling of 12140111022223 in words is "twelve trillion, one hundred forty billion, one hundred eleven million, twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •