Base | Representation |
---|---|
bin | 110001010001000100… |
… | …1011000011000011001 |
3 | 101010002100120200211121 |
4 | 1202202021120120121 |
5 | 3213134143131012 |
6 | 120334220125241 |
7 | 10433545422334 |
oct | 1424211303031 |
9 | 333070520747 |
10 | 105799583257 |
11 | 40962119915 |
12 | 18608096821 |
13 | 9c91206604 |
14 | 51993bd61b |
15 | 2b43484a07 |
hex | 18a2258619 |
105799583257 has 2 divisors, whose sum is σ = 105799583258. Its totient is φ = 105799583256.
The previous prime is 105799583221. The next prime is 105799583293. The reversal of 105799583257 is 752385997501.
It is a balanced prime because it is at equal distance from previous prime (105799583221) and next prime (105799583293).
It can be written as a sum of positive squares in only one way, i.e., 80513495001 + 25286088256 = 283749^2 + 159016^2 .
It is a cyclic number.
It is not a de Polignac number, because 105799583257 - 215 = 105799550489 is a prime.
It is a super-2 number, since 2×1057995832572 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105799583195 and 105799583204.
It is not a weakly prime, because it can be changed into another prime (105799583957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52899791628 + 52899791629.
It is an arithmetic number, because the mean of its divisors is an integer number (52899791629).
Almost surely, 2105799583257 is an apocalyptic number.
It is an amenable number.
105799583257 is a deficient number, since it is larger than the sum of its proper divisors (1).
105799583257 is an equidigital number, since it uses as much as digits as its factorization.
105799583257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23814000, while the sum is 61.
The spelling of 105799583257 in words is "one hundred five billion, seven hundred ninety-nine million, five hundred eighty-three thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •