Base | Representation |
---|---|
bin | 1001000110001000100000… |
… | …0101000001010001000101 |
3 | 1022102002020120120222002122 |
4 | 2101202020011001101011 |
5 | 2302323440010213443 |
6 | 33134214124415325 |
7 | 2051355165613325 |
oct | 221421005012105 |
9 | 38362216528078 |
10 | 10000966882373 |
11 | 3206428098065 |
12 | 11563076a7545 |
13 | 57711956b67c |
14 | 2680996d9285 |
15 | 125234c81968 |
hex | 91888141445 |
10000966882373 has 2 divisors, whose sum is σ = 10000966882374. Its totient is φ = 10000966882372.
The previous prime is 10000966882351. The next prime is 10000966882483. The reversal of 10000966882373 is 37328866900001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6501515737249 + 3499451145124 = 2549807^2 + 1870682^2 .
It is a cyclic number.
It is not a de Polignac number, because 10000966882373 - 210 = 10000966881349 is a prime.
It is a super-2 number, since 2×100009668823732 (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 (10000966882573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000483441186 + 5000483441187.
It is an arithmetic number, because the mean of its divisors is an integer number (5000483441187).
Almost surely, 210000966882373 is an apocalyptic number.
It is an amenable number.
10000966882373 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000966882373 is an equidigital number, since it uses as much as digits as its factorization.
10000966882373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2612736, while the sum is 53.
The spelling of 10000966882373 in words is "ten trillion, nine hundred sixty-six million, eight hundred eighty-two thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •