Base | Representation |
---|---|
bin | 1011000001100110110010… |
… | …1111100010011000010111 |
3 | 1120220212120111112121110211 |
4 | 2300121230233202120113 |
5 | 3042102302330011411 |
6 | 41440512202030251 |
7 | 2360541651552262 |
oct | 260315457423027 |
9 | 46825514477424 |
10 | 12122222110231 |
11 | 39540073a0262 |
12 | 143944b7a8387 |
13 | 69c17507a37c |
14 | 2dca0c0b9cd9 |
15 | 1604d800e221 |
hex | b066cbe2617 |
12122222110231 has 2 divisors, whose sum is σ = 12122222110232. Its totient is φ = 12122222110230.
The previous prime is 12122222110199. The next prime is 12122222110337. The reversal of 12122222110231 is 13201122222121.
12122222110231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12122222110231 - 25 = 12122222110199 is a prime.
It is a super-2 number, since 2×121222221102312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12122222111231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6061111055115 + 6061111055116.
It is an arithmetic number, because the mean of its divisors is an integer number (6061111055116).
Almost surely, 212122222110231 is an apocalyptic number.
12122222110231 is a deficient number, since it is larger than the sum of its proper divisors (1).
12122222110231 is an equidigital number, since it uses as much as digits as its factorization.
12122222110231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 12122222110231 its reverse (13201122222121), we get a palindrome (25323344332352).
The spelling of 12122222110231 in words is "twelve trillion, one hundred twenty-two billion, two hundred twenty-two million, one hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •