Base | Representation |
---|---|
bin | 1011000100010100100010… |
… | …1110000011101100000001 |
3 | 1121002022221221102221120012 |
4 | 2301011020232003230001 |
5 | 3043333312232222344 |
6 | 41514144224554305 |
7 | 2364112516412414 |
oct | 261051056035401 |
9 | 47068857387505 |
10 | 12168862382849 |
11 | 3971870634407 |
12 | 14464a7482995 |
13 | 6a3698a54c13 |
14 | 300d94523b7b |
15 | 16181795429e |
hex | b1148b83b01 |
12168862382849 has 2 divisors, whose sum is σ = 12168862382850. Its totient is φ = 12168862382848.
The previous prime is 12168862382839. The next prime is 12168862382851. The reversal of 12168862382849 is 94828326886121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11928009153025 + 240853229824 = 3453695^2 + 490768^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12168862382849 is a prime.
Together with 12168862382851, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (12168862382839) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6084431191424 + 6084431191425.
It is an arithmetic number, because the mean of its divisors is an integer number (6084431191425).
Almost surely, 212168862382849 is an apocalyptic number.
It is an amenable number.
12168862382849 is a deficient number, since it is larger than the sum of its proper divisors (1).
12168862382849 is an equidigital number, since it uses as much as digits as its factorization.
12168862382849 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 127401984, while the sum is 68.
The spelling of 12168862382849 in words is "twelve trillion, one hundred sixty-eight billion, eight hundred sixty-two million, three hundred eighty-two thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •