Base | Representation |
---|---|
bin | 110000101010011001… |
… | …1101100001000001111 |
3 | 100222201221001020200001 |
4 | 1201110303230020033 |
5 | 3203010011120333 |
6 | 120001345345131 |
7 | 10356441531424 |
oct | 1412463541017 |
9 | 328657036601 |
10 | 104502051343 |
11 | 40356757998 |
12 | 183056381a7 |
13 | 9b15453b51 |
14 | 50b4d41d4b |
15 | 2ab95d0b7d |
hex | 1854cec20f |
104502051343 has 4 divisors (see below), whose sum is σ = 104565890520. Its totient is φ = 104438212168.
The previous prime is 104502051323. The next prime is 104502051371. The reversal of 104502051343 is 343150205401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 343150205401 = 211 ⋅1626304291.
It is a cyclic number.
It is not a de Polignac number, because 104502051343 - 29 = 104502050831 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104502051323) 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, 31917133 + ... + 31920406.
It is an arithmetic number, because the mean of its divisors is an integer number (26141472630).
Almost surely, 2104502051343 is an apocalyptic number.
104502051343 is a deficient number, since it is larger than the sum of its proper divisors (63839177).
104502051343 is an equidigital number, since it uses as much as digits as its factorization.
104502051343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63839176.
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 104502051343 its reverse (343150205401), we get a palindrome (447652256744).
The spelling of 104502051343 in words is "one hundred four billion, five hundred two million, fifty-one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •