Base | Representation |
---|---|
bin | 1011000110110001111001… |
… | …1110000010001001100011 |
3 | 1121020100222210000101221210 |
4 | 2301230132132002021203 |
5 | 3100031314410242011 |
6 | 41545411532321203 |
7 | 2400136343503245 |
oct | 261543636021143 |
9 | 47210883011853 |
10 | 12211103212131 |
11 | 398877746967a |
12 | 1452715913203 |
13 | 6a766b132c65 |
14 | 30304055a095 |
15 | 16298b0206a6 |
hex | b1b1e782263 |
12211103212131 has 16 divisors (see below), whose sum is σ = 16592043676160. Its totient is φ = 7986153359520.
The previous prime is 12211103212123. The next prime is 12211103212171. The reversal of 12211103212131 is 13121230111221.
It is not a de Polignac number, because 12211103212131 - 23 = 12211103212123 is a prime.
It is a super-2 number, since 2×122111032121312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12211103212098 and 12211103212107.
It is not an unprimeable number, because it can be changed into a prime (12211103212171) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 87961435 + ... + 88100148.
It is an arithmetic number, because the mean of its divisors is an integer number (1037002729760).
Almost surely, 212211103212131 is an apocalyptic number.
12211103212131 is a deficient number, since it is larger than the sum of its proper divisors (4380940464029).
12211103212131 is a wasteful number, since it uses less digits than its factorization.
12211103212131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176062026.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 12211103212131 its reverse (13121230111221), we get a palindrome (25332333323352).
The spelling of 12211103212131 in words is "twelve trillion, two hundred eleven billion, one hundred three million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •