Base | Representation |
---|---|
bin | 110001101111010110… |
… | …0001011101010001101 |
3 | 101012201010220102222012 |
4 | 1203132230023222031 |
5 | 3222224211323044 |
6 | 121023103231005 |
7 | 10500661254641 |
oct | 1433654135215 |
9 | 335633812865 |
10 | 106815339149 |
11 | 413335242a2 |
12 | 188502a8465 |
13 | a0c379c1bc |
14 | 525426cc21 |
15 | 2ba272959e |
hex | 18deb0ba8d |
106815339149 has 2 divisors, whose sum is σ = 106815339150. Its totient is φ = 106815339148.
The previous prime is 106815339139. The next prime is 106815339157. The reversal of 106815339149 is 941933518601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87324387049 + 19490952100 = 295507^2 + 139610^2 .
It is an emirp because it is prime and its reverse (941933518601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106815339149 is a prime.
It is a super-2 number, since 2×1068153391492 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106815339097 and 106815339106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106815339139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53407669574 + 53407669575.
It is an arithmetic number, because the mean of its divisors is an integer number (53407669575).
Almost surely, 2106815339149 is an apocalyptic number.
It is an amenable number.
106815339149 is a deficient number, since it is larger than the sum of its proper divisors (1).
106815339149 is an equidigital number, since it uses as much as digits as its factorization.
106815339149 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 699840, while the sum is 50.
The spelling of 106815339149 in words is "one hundred six billion, eight hundred fifteen million, three hundred thirty-nine thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •