Base | Representation |
---|---|
bin | 1011000001011110111001… |
… | …0001011110110110001111 |
3 | 1120220200002121222121002001 |
4 | 2300113232101132312033 |
5 | 3042033431134132343 |
6 | 41435521444213131 |
7 | 2360435245516144 |
oct | 260275621366617 |
9 | 46820077877061 |
10 | 12120100302223 |
11 | 3953118717521 |
12 | 1438b5909a1a7 |
13 | 69bbc75c5184 |
14 | 2dc88a3943cb |
15 | 160411ada44d |
hex | b05ee45ed8f |
12120100302223 has 4 divisors (see below), whose sum is σ = 12120126917080. Its totient is φ = 12120073687368.
The previous prime is 12120100302179. The next prime is 12120100302241. The reversal of 12120100302223 is 32220300102121.
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-12120100302223 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 12120100302223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120100302293) 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, 12612240 + ... + 13539157.
It is an arithmetic number, because the mean of its divisors is an integer number (3030031729270).
Almost surely, 212120100302223 is an apocalyptic number.
12120100302223 is a deficient number, since it is larger than the sum of its proper divisors (26614857).
12120100302223 is an equidigital number, since it uses as much as digits as its factorization.
12120100302223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26614856.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 12120100302223 its reverse (32220300102121), we get a palindrome (44340400404344).
The spelling of 12120100302223 in words is "twelve trillion, one hundred twenty billion, one hundred million, three hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •