Base | Representation |
---|---|
bin | 1001001010111101001100… |
… | …0010010110110101111001 |
3 | 1022201000010101000021021211 |
4 | 2102233103002112311321 |
5 | 2310203140141313022 |
6 | 33240240320203121 |
7 | 2060350452012043 |
oct | 222572302266571 |
9 | 38630111007254 |
10 | 10083828854137 |
11 | 3238589559965 |
12 | 116a391a694a1 |
13 | 581b935bacac |
14 | 26c0ba5caa93 |
15 | 12748462be77 |
hex | 92bd3096d79 |
10083828854137 has 2 divisors, whose sum is σ = 10083828854138. Its totient is φ = 10083828854136.
The previous prime is 10083828854123. The next prime is 10083828854159. The reversal of 10083828854137 is 73145882838001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9345640300096 + 738188554041 = 3057064^2 + 859179^2 .
It is an emirp because it is prime and its reverse (73145882838001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10083828854137 - 235 = 10049469115769 is a prime.
It is not a weakly prime, because it can be changed into another prime (10083828855137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5041914427068 + 5041914427069.
It is an arithmetic number, because the mean of its divisors is an integer number (5041914427069).
Almost surely, 210083828854137 is an apocalyptic number.
It is an amenable number.
10083828854137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10083828854137 is an equidigital number, since it uses as much as digits as its factorization.
10083828854137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10321920, while the sum is 58.
The spelling of 10083828854137 in words is "ten trillion, eighty-three billion, eight hundred twenty-eight million, eight hundred fifty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •