Base | Representation |
---|---|
bin | 1001000110101011110001… |
… | …0111101000101100111101 |
3 | 1022102222200100212002002201 |
4 | 2101222330113220230331 |
5 | 2303002332113043232 |
6 | 33142421400151501 |
7 | 2052141614004652 |
oct | 221527427505475 |
9 | 38388610762081 |
10 | 10010434112317 |
11 | 320a4460a3041 |
12 | 115810a168591 |
13 | 577c97a6bc92 |
14 | 268716bb5c29 |
15 | 1255daea1be7 |
hex | 91abc5e8b3d |
10010434112317 has 2 divisors, whose sum is σ = 10010434112318. Its totient is φ = 10010434112316.
The previous prime is 10010434112257. The next prime is 10010434112323. The reversal of 10010434112317 is 71321143401001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9957723003396 + 52711108921 = 3155586^2 + 229589^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10010434112317 is a prime.
It is a super-2 number, since 2×100104341123172 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10010434112347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005217056158 + 5005217056159.
It is an arithmetic number, because the mean of its divisors is an integer number (5005217056159).
Almost surely, 210010434112317 is an apocalyptic number.
It is an amenable number.
10010434112317 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010434112317 is an equidigital number, since it uses as much as digits as its factorization.
10010434112317 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2016, while the sum is 28.
Adding to 10010434112317 its reverse (71321143401001), we get a palindrome (81331577513318).
The spelling of 10010434112317 in words is "ten trillion, ten billion, four hundred thirty-four million, one hundred twelve thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •