Base | Representation |
---|---|
bin | 10010000011111101011… |
… | …010101001110111001011 |
3 | 11101122202111220221110222 |
4 | 102003331122221313023 |
5 | 130313440231012412 |
6 | 2350111142500255 |
7 | 155450101442045 |
oct | 22037532516713 |
9 | 4348674827428 |
10 | 1241202204107 |
11 | 439433316948 |
12 | 18067813468b |
13 | 90077753a38 |
14 | 4410863aa95 |
15 | 22446ee6072 |
hex | 120fd6a9dcb |
1241202204107 has 2 divisors, whose sum is σ = 1241202204108. Its totient is φ = 1241202204106.
The previous prime is 1241202204101. The next prime is 1241202204113. The reversal of 1241202204107 is 7014022021421.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (1241202204101) and next prime (1241202204113).
It is a cyclic number.
It is not a de Polignac number, because 1241202204107 - 26 = 1241202204043 is a prime.
It is a super-2 number, since 2×12412022041072 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1241202204101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 620601102053 + 620601102054.
It is an arithmetic number, because the mean of its divisors is an integer number (620601102054).
Almost surely, 21241202204107 is an apocalyptic number.
1241202204107 is a deficient number, since it is larger than the sum of its proper divisors (1).
1241202204107 is an equidigital number, since it uses as much as digits as its factorization.
1241202204107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 26.
Adding to 1241202204107 its reverse (7014022021421), we get a palindrome (8255224225528).
The spelling of 1241202204107 in words is "one trillion, two hundred forty-one billion, two hundred two million, two hundred four thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •