Base | Representation |
---|---|
bin | 1110010101001010111… |
… | …0110000000100110001 |
3 | 212112111011211220201121 |
4 | 3211102232300010301 |
5 | 13013204441414441 |
6 | 305034144302241 |
7 | 23534044005652 |
oct | 3452256600461 |
9 | 775434756647 |
10 | 246201123121 |
11 | 9546012a888 |
12 | 3b870311981 |
13 | 1a2a8028a55 |
14 | bcb8093529 |
15 | 660e570dd1 |
hex | 3952bb0131 |
246201123121 has 2 divisors, whose sum is σ = 246201123122. Its totient is φ = 246201123120.
The previous prime is 246201123109. The next prime is 246201123247. The reversal of 246201123121 is 121321102642.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 129466834225 + 116734288896 = 359815^2 + 341664^2 .
It is a cyclic number.
It is not a de Polignac number, because 246201123121 - 25 = 246201123089 is a prime.
It is a super-2 number, since 2×2462011231212 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (246201124121) 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, 123100561560 + 123100561561.
It is an arithmetic number, because the mean of its divisors is an integer number (123100561561).
Almost surely, 2246201123121 is an apocalyptic number.
It is an amenable number.
246201123121 is a deficient number, since it is larger than the sum of its proper divisors (1).
246201123121 is an equidigital number, since it uses as much as digits as its factorization.
246201123121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 246201123121 its reverse (121321102642), we get a palindrome (367522225763).
The spelling of 246201123121 in words is "two hundred forty-six billion, two hundred one million, one hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •