Base | Representation |
---|---|
bin | 1011000001000001111100… |
… | …1011111111000010101111 |
3 | 1120212221001011200200001111 |
4 | 2300100133023333002233 |
5 | 3041422023214311343 |
6 | 41432154505252451 |
7 | 2360041565601103 |
oct | 260203713770257 |
9 | 46787034620044 |
10 | 12112331010223 |
11 | 394a8a10a6444 |
12 | 143754b194127 |
13 | 69b259acb682 |
14 | 2dc3505c3903 |
15 | 1601099b2c9d |
hex | b041f2ff0af |
12112331010223 has 8 divisors (see below), whose sum is σ = 12638989202400. Its totient is φ = 11585675743488.
The previous prime is 12112331010193. The next prime is 12112331010287. The reversal of 12112331010223 is 32201013321121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12112331010223 - 29 = 12112331009711 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12112331010194 and 12112331010203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12112331010623) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14321083 + ... + 15143251.
It is an arithmetic number, because the mean of its divisors is an integer number (1579873650300).
Almost surely, 212112331010223 is an apocalyptic number.
12112331010223 is a deficient number, since it is larger than the sum of its proper divisors (526658192177).
12112331010223 is an equidigital number, since it uses as much as digits as its factorization.
12112331010223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1462721.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 12112331010223 its reverse (32201013321121), we get a palindrome (44313344331344).
The spelling of 12112331010223 in words is "twelve trillion, one hundred twelve billion, three hundred thirty-one million, ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •