Base | Representation |
---|---|
bin | 1011000111111101001110… |
… | …0000001110001101011101 |
3 | 1121022022011202002110102212 |
4 | 2301333103200032031131 |
5 | 3100344221001043401 |
6 | 42002554015330205 |
7 | 2401453343254124 |
oct | 261772340161535 |
9 | 47268152073385 |
10 | 12231320331101 |
11 | 3996301503363 |
12 | 1456618520965 |
13 | 6a95407a9b51 |
14 | 303ddb5dcabb |
15 | 163270d77dbb |
hex | b1fd380e35d |
12231320331101 has 4 divisors (see below), whose sum is σ = 12232047926304. Its totient is φ = 12230592735900.
The previous prime is 12231320331073. The next prime is 12231320331127. The reversal of 12231320331101 is 10113302313221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12231320331101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12231320333101) 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, 363772385 + ... + 363806006.
It is an arithmetic number, because the mean of its divisors is an integer number (3058011981576).
Almost surely, 212231320331101 is an apocalyptic number.
It is an amenable number.
12231320331101 is a deficient number, since it is larger than the sum of its proper divisors (727595203).
12231320331101 is an equidigital number, since it uses as much as digits as its factorization.
12231320331101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 727595202.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 12231320331101 its reverse (10113302313221), we get a palindrome (22344622644322).
The spelling of 12231320331101 in words is "twelve trillion, two hundred thirty-one billion, three hundred twenty million, three hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •