Base | Representation |
---|---|
bin | 1011000110110001100011… |
… | …1010110101111110011111 |
3 | 1121020100202021210212200222 |
4 | 2301230120322311332133 |
5 | 3100031122041214101 |
6 | 41545354404511555 |
7 | 2400134133202541 |
oct | 261543072657637 |
9 | 47210667725628 |
10 | 12211010101151 |
11 | 3988729952a54 |
12 | 14526aa6ab5bb |
13 | 6a7654a61cc4 |
14 | 30303203d691 |
15 | 162982c7c01b |
hex | b1b18eb5f9f |
12211010101151 has 2 divisors, whose sum is σ = 12211010101152. Its totient is φ = 12211010101150.
The previous prime is 12211010101139. The next prime is 12211010101153. The reversal of 12211010101151 is 15110101011221.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12211010101151 is a prime.
Together with 12211010101153, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12211010101153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105505050575 + 6105505050576.
It is an arithmetic number, because the mean of its divisors is an integer number (6105505050576).
Almost surely, 212211010101151 is an apocalyptic number.
12211010101151 is a deficient number, since it is larger than the sum of its proper divisors (1).
12211010101151 is an equidigital number, since it uses as much as digits as its factorization.
12211010101151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20, while the sum is 17.
Adding to 12211010101151 its reverse (15110101011221), we get a palindrome (27321111112372).
The spelling of 12211010101151 in words is "twelve trillion, two hundred eleven billion, ten million, one hundred one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •