Base | Representation |
---|---|
bin | 110001010001101010… |
… | …0000001111111111001 |
3 | 101010010201101220121211 |
4 | 1202203110001333321 |
5 | 3213204200334002 |
6 | 120340155403121 |
7 | 10434203645221 |
oct | 1424324017771 |
9 | 333121356554 |
10 | 105819152377 |
11 | 40972175444 |
12 | 186127534a1 |
13 | 9c95298883 |
14 | 519bc35081 |
15 | 2b4504cdd7 |
hex | 18a3501ff9 |
105819152377 has 2 divisors, whose sum is σ = 105819152378. Its totient is φ = 105819152376.
The previous prime is 105819152363. The next prime is 105819152389. The reversal of 105819152377 is 773251918501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99020984976 + 6798167401 = 314676^2 + 82451^2 .
It is a cyclic number.
It is not a de Polignac number, because 105819152377 - 223 = 105810763769 is a prime.
It is a super-2 number, since 2×1058191523772 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105819152377.
It is not a weakly prime, because it can be changed into another prime (105819152347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52909576188 + 52909576189.
It is an arithmetic number, because the mean of its divisors is an integer number (52909576189).
Almost surely, 2105819152377 is an apocalyptic number.
It is an amenable number.
105819152377 is a deficient number, since it is larger than the sum of its proper divisors (1).
105819152377 is an equidigital number, since it uses as much as digits as its factorization.
105819152377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 529200, while the sum is 49.
The spelling of 105819152377 in words is "one hundred five billion, eight hundred nineteen million, one hundred fifty-two thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •