Base | Representation |
---|---|
bin | 100011111000110000010… |
… | …100101011000101111101 |
3 | 22201202111021112111100121 |
4 | 203320300110223011331 |
5 | 310401104210004121 |
6 | 5124530520054541 |
7 | 343112541511132 |
oct | 43706024530575 |
9 | 8652437474317 |
10 | 2466121953661 |
11 | 870970607683 |
12 | 339b4b304451 |
13 | 14b728a57882 |
14 | 8750a5bc589 |
15 | 44239801141 |
hex | 23e3052b17d |
2466121953661 has 2 divisors, whose sum is σ = 2466121953662. Its totient is φ = 2466121953660.
The previous prime is 2466121953637. The next prime is 2466121953683. The reversal of 2466121953661 is 1663591216642.
2466121953661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1348894093561 + 1117227860100 = 1161419^2 + 1056990^2 .
It is a cyclic number.
It is not a de Polignac number, because 2466121953661 - 25 = 2466121953629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2466121953599 and 2466121953608.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2466121953161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1233060976830 + 1233060976831.
It is an arithmetic number, because the mean of its divisors is an integer number (1233060976831).
Almost surely, 22466121953661 is an apocalyptic number.
It is an amenable number.
2466121953661 is a deficient number, since it is larger than the sum of its proper divisors (1).
2466121953661 is an equidigital number, since it uses as much as digits as its factorization.
2466121953661 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2799360, while the sum is 52.
The spelling of 2466121953661 in words is "two trillion, four hundred sixty-six billion, one hundred twenty-one million, nine hundred fifty-three thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •