Base | Representation |
---|---|
bin | 1011000111011110100110… |
… | …1010001010101011010111 |
3 | 1121021111222000001011210211 |
4 | 2301313221222022223113 |
5 | 3100230403114232411 |
6 | 41555114322230251 |
7 | 2401042602415156 |
oct | 261675152125327 |
9 | 47244860034724 |
10 | 12223102102231 |
11 | 3992874532379 |
12 | 1454b041b5387 |
13 | 6a8830c99527 |
14 | 30385bd6959d |
15 | 162e3e622221 |
hex | b1de9a8aad7 |
12223102102231 has 8 divisors (see below), whose sum is σ = 12618208825344. Its totient is φ = 11828046198360.
The previous prime is 12223102102229. The next prime is 12223102102241. The reversal of 12223102102231 is 13220120132221.
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 12223102102231 - 21 = 12223102102229 is a prime.
It is a super-2 number, since 2×122231021022312 (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 (12223102102241) 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, 12215695 + ... + 13178368.
It is an arithmetic number, because the mean of its divisors is an integer number (1577276103168).
Almost surely, 212223102102231 is an apocalyptic number.
12223102102231 is a deficient number, since it is larger than the sum of its proper divisors (395106723113).
12223102102231 is a wasteful number, since it uses less digits than its factorization.
12223102102231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25409621.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 12223102102231 its reverse (13220120132221), we get a palindrome (25443222234452).
The spelling of 12223102102231 in words is "twelve trillion, two hundred twenty-three billion, one hundred two million, one hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •