Base | Representation |
---|---|
bin | 1011000000011000100011… |
… | …1011101100000100101111 |
3 | 1120211212100211210002220002 |
4 | 2300012020323230010233 |
5 | 3041231244334034411 |
6 | 41423120202414515 |
7 | 2356166342466221 |
oct | 260061073540457 |
9 | 46755324702802 |
10 | 12101220221231 |
11 | 394610a3781a9 |
12 | 143536a20143b |
13 | 69a1a8c5380b |
14 | 2db9b8b14411 |
15 | 15eba933c33b |
hex | b0188eec12f |
12101220221231 has 4 divisors (see below), whose sum is σ = 12101234628000. Its totient is φ = 12101205814464.
The previous prime is 12101220221221. The next prime is 12101220221267. The reversal of 12101220221231 is 13212202210121.
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 12101220221231 - 234 = 12084040352047 is a prime.
It is a super-2 number, since 2×121012202212312 (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 (12101220221201) 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, 5859911 + ... + 7651208.
It is an arithmetic number, because the mean of its divisors is an integer number (3025308657000).
Almost surely, 212101220221231 is an apocalyptic number.
12101220221231 is a deficient number, since it is larger than the sum of its proper divisors (14406769).
12101220221231 is an equidigital number, since it uses as much as digits as its factorization.
12101220221231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14406768.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 12101220221231 its reverse (13212202210121), we get a palindrome (25313422431352).
The spelling of 12101220221231 in words is "twelve trillion, one hundred one billion, two hundred twenty million, two hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •