Base | Representation |
---|---|
bin | 1001011110000011110000… |
… | …1010010101000110111001 |
3 | 1100212101012212212012121211 |
4 | 2113200330022111012321 |
5 | 2331042244034110421 |
6 | 34051113354403121 |
7 | 2123146213206121 |
oct | 227407412250671 |
9 | 40771185765554 |
10 | 10412010066361 |
11 | 3354788272aa2 |
12 | 1201b011304a1 |
13 | 5a6b04a441b7 |
14 | 27dd303adc81 |
15 | 130c90de99e1 |
hex | 9783c2951b9 |
10412010066361 has 4 divisors (see below), whose sum is σ = 10412966272500. Its totient is φ = 10411053860224.
The previous prime is 10412010066331. The next prime is 10412010066397. The reversal of 10412010066361 is 16366001021401.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1886667073600 + 8525342992761 = 1373560^2 + 2919819^2 .
It is a cyclic number.
It is not a de Polignac number, because 10412010066361 - 229 = 10411473195449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10412010066331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 478086736 + ... + 478108513.
It is an arithmetic number, because the mean of its divisors is an integer number (2603241568125).
Almost surely, 210412010066361 is an apocalyptic number.
It is an amenable number.
10412010066361 is a deficient number, since it is larger than the sum of its proper divisors (956206139).
10412010066361 is an equidigital number, since it uses as much as digits as its factorization.
10412010066361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 956206138.
The product of its (nonzero) digits is 5184, while the sum is 31.
Adding to 10412010066361 its reverse (16366001021401), we get a palindrome (26778011087762).
The spelling of 10412010066361 in words is "ten trillion, four hundred twelve billion, ten million, sixty-six thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •