Base | Representation |
---|---|
bin | 110000111101011001… |
… | …1111111100111001101 |
3 | 101001101100211101122220 |
4 | 1201322303333213031 |
5 | 3210311223242412 |
6 | 120144523525553 |
7 | 10411313260416 |
oct | 1417263774715 |
9 | 331340741586 |
10 | 105139665357 |
11 | 40653666821 |
12 | 184630898b9 |
13 | 9bb758c24c |
14 | 51358ba80d |
15 | 2b0557d68c |
hex | 187acff9cd |
105139665357 has 4 divisors (see below), whose sum is σ = 140186220480. Its totient is φ = 70093110236.
The previous prime is 105139665353. The next prime is 105139665413. The reversal of 105139665357 is 753566931501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 753566931501 = 3 ⋅251188977167.
It is a cyclic number.
It is not a de Polignac number, because 105139665357 - 22 = 105139665353 is a prime.
It is a super-2 number, since 2×1051396653572 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105139665353) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17523277557 + ... + 17523277562.
It is an arithmetic number, because the mean of its divisors is an integer number (35046555120).
Almost surely, 2105139665357 is an apocalyptic number.
It is an amenable number.
105139665357 is a deficient number, since it is larger than the sum of its proper divisors (35046555123).
105139665357 is an equidigital number, since it uses as much as digits as its factorization.
105139665357 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35046555122.
The product of its (nonzero) digits is 2551500, while the sum is 51.
The spelling of 105139665357 in words is "one hundred five billion, one hundred thirty-nine million, six hundred sixty-five thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •