Base | Representation |
---|---|
bin | 1011000110110110011011… |
… | …1111110101011001001011 |
3 | 1121020111010120200021110121 |
4 | 2301231212333311121023 |
5 | 3100041312412013311 |
6 | 41550132401124111 |
7 | 2400211450345066 |
oct | 261554677653113 |
9 | 47214116607417 |
10 | 12212320032331 |
11 | 3989241313701 |
12 | 14529b5329637 |
13 | 6a7803266403 |
14 | 303117dc78dd |
15 | 162a0cc7eb71 |
hex | b1b66ff564b |
12212320032331 has 2 divisors, whose sum is σ = 12212320032332. Its totient is φ = 12212320032330.
The previous prime is 12212320032329. The next prime is 12212320032383. The reversal of 12212320032331 is 13323002321221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12212320032331 - 21 = 12212320032329 is a prime.
It is a super-2 number, since 2×122123200323312 (a number of 27 digits) contains 22 as substring.
Together with 12212320032329, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 12212320032296 and 12212320032305.
It is not a weakly prime, because it can be changed into another prime (12212320039331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6106160016165 + 6106160016166.
It is an arithmetic number, because the mean of its divisors is an integer number (6106160016166).
Almost surely, 212212320032331 is an apocalyptic number.
12212320032331 is a deficient number, since it is larger than the sum of its proper divisors (1).
12212320032331 is an equidigital number, since it uses as much as digits as its factorization.
12212320032331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 12212320032331 its reverse (13323002321221), we get a palindrome (25535322353552).
The spelling of 12212320032331 in words is "twelve trillion, two hundred twelve billion, three hundred twenty million, thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •