Base | Representation |
---|---|
bin | 1001001101000110010111… |
… | …0000000111001010101101 |
3 | 1022211112011111121100122012 |
4 | 2103101211300013022231 |
5 | 2311304042403413321 |
6 | 33305210142331005 |
7 | 2063123100054563 |
oct | 223214560071255 |
9 | 38745144540565 |
10 | 10120650060461 |
11 | 3252164129196 |
12 | 1175549289a65 |
13 | 5854b0c18245 |
14 | 26dbb092da33 |
15 | 1283dc00405b |
hex | 93465c072ad |
10120650060461 has 2 divisors, whose sum is σ = 10120650060462. Its totient is φ = 10120650060460.
The previous prime is 10120650060439. The next prime is 10120650060463. The reversal of 10120650060461 is 16406005602101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5175670500100 + 4944979560361 = 2275010^2 + 2223731^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120650060461 - 26 = 10120650060397 is a prime.
Together with 10120650060463, 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 (10120650060463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060325030230 + 5060325030231.
It is an arithmetic number, because the mean of its divisors is an integer number (5060325030231).
Almost surely, 210120650060461 is an apocalyptic number.
It is an amenable number.
10120650060461 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120650060461 is an equidigital number, since it uses as much as digits as its factorization.
10120650060461 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 32.
Adding to 10120650060461 its reverse (16406005602101), we get a palindrome (26526655662562).
The spelling of 10120650060461 in words is "ten trillion, one hundred twenty billion, six hundred fifty million, sixty thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •