Base | Representation |
---|---|
bin | 110000111101010100… |
… | …0101011111001111001 |
3 | 101001101011020210101201 |
4 | 1201322220223321321 |
5 | 3210304443413144 |
6 | 120144340214201 |
7 | 10411246133212 |
oct | 1417250537171 |
9 | 331334223351 |
10 | 105136701049 |
11 | 40651a21686 |
12 | 1846209a361 |
13 | 9bb6a91c13 |
14 | 5135348409 |
15 | 2b051951d4 |
hex | 187aa2be79 |
105136701049 has 2 divisors, whose sum is σ = 105136701050. Its totient is φ = 105136701048.
The previous prime is 105136701029. The next prime is 105136701101. The reversal of 105136701049 is 940107631501.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80674177024 + 24462524025 = 284032^2 + 156405^2 .
It is an emirp because it is prime and its reverse (940107631501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105136701049 - 211 = 105136699001 is a prime.
It is a super-2 number, since 2×1051367010492 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105136700999 and 105136701017.
It is not a weakly prime, because it can be changed into another prime (105136701029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52568350524 + 52568350525.
It is an arithmetic number, because the mean of its divisors is an integer number (52568350525).
Almost surely, 2105136701049 is an apocalyptic number.
It is an amenable number.
105136701049 is a deficient number, since it is larger than the sum of its proper divisors (1).
105136701049 is an equidigital number, since it uses as much as digits as its factorization.
105136701049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680, while the sum is 37.
The spelling of 105136701049 in words is "one hundred five billion, one hundred thirty-six million, seven hundred one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •