Base | Representation |
---|---|
bin | 110001001001010100… |
… | …1000101110010001111 |
3 | 101002102020010002010202 |
4 | 1202102221011302033 |
5 | 3212121100211424 |
6 | 120252324524115 |
7 | 10424236416233 |
oct | 1422251056217 |
9 | 332366102122 |
10 | 105539460239 |
11 | 40839301614 |
12 | 18554b5063b |
13 | 9c4c35b375 |
14 | 5172a2a5c3 |
15 | 2b2a7012ae |
hex | 1892a45c8f |
105539460239 has 4 divisors (see below), whose sum is σ = 105541662720. Its totient is φ = 105537257760.
The previous prime is 105539460211. The next prime is 105539460253. The reversal of 105539460239 is 932064935501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 105539460239 - 220 = 105538411663 is a prime.
It is a super-2 number, since 2×1055394602392 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105539460193 and 105539460202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105539460259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1027727 + ... + 1125744.
It is an arithmetic number, because the mean of its divisors is an integer number (26385415680).
Almost surely, 2105539460239 is an apocalyptic number.
105539460239 is a deficient number, since it is larger than the sum of its proper divisors (2202481).
105539460239 is an equidigital number, since it uses as much as digits as its factorization.
105539460239 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2202480.
The product of its (nonzero) digits is 874800, while the sum is 47.
The spelling of 105539460239 in words is "one hundred five billion, five hundred thirty-nine million, four hundred sixty thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •