Base | Representation |
---|---|
bin | 110001000011110011… |
… | …0011001000000000001 |
3 | 101001221022112001011121 |
4 | 1202013212121000001 |
5 | 3211231134000022 |
6 | 120222110112241 |
7 | 10416526644121 |
oct | 1420746310001 |
9 | 331838461147 |
10 | 105354203137 |
11 | 40753779177 |
12 | 18502aab681 |
13 | 9c1cb66691 |
14 | 51561a4c81 |
15 | 2b1930a2c7 |
hex | 1887999001 |
105354203137 has 2 divisors, whose sum is σ = 105354203138. Its totient is φ = 105354203136.
The previous prime is 105354203117. The next prime is 105354203183. The reversal of 105354203137 is 731302453501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101118276081 + 4235927056 = 317991^2 + 65084^2 .
It is a cyclic number.
It is not a de Polignac number, because 105354203137 - 211 = 105354201089 is a prime.
It is a super-2 number, since 2×1053542031372 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105354203117) 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, 52677101568 + 52677101569.
It is an arithmetic number, because the mean of its divisors is an integer number (52677101569).
Almost surely, 2105354203137 is an apocalyptic number.
It is an amenable number.
105354203137 is a deficient number, since it is larger than the sum of its proper divisors (1).
105354203137 is an equidigital number, since it uses as much as digits as its factorization.
105354203137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37800, while the sum is 34.
Adding to 105354203137 its reverse (731302453501), we get a palindrome (836656656638).
The spelling of 105354203137 in words is "one hundred five billion, three hundred fifty-four million, two hundred three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •