Base | Representation |
---|---|
bin | 110000011111101000… |
… | …0000110011000001111 |
3 | 100221210201112110111011 |
4 | 1200333100012120033 |
5 | 3201234420301033 |
6 | 115501430110051 |
7 | 10344460536643 |
oct | 1407720063017 |
9 | 327721473434 |
10 | 104140400143 |
11 | 401905a4aaa |
12 | 182244ab327 |
13 | 9a8854b660 |
14 | 507ccc0c23 |
15 | 2a97994ccd |
hex | 183f40660f |
104140400143 has 8 divisors (see below), whose sum is σ = 112248654336. Its totient is φ = 96046068000.
The previous prime is 104140400141. The next prime is 104140400213. The reversal of 104140400143 is 341004041401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104140400143 - 21 = 104140400141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104140400141) 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 7 ways as a sum of consecutive naturals, for example, 3464968 + ... + 3494893.
It is an arithmetic number, because the mean of its divisors is an integer number (14031081792).
Almost surely, 2104140400143 is an apocalyptic number.
104140400143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
104140400143 is a deficient number, since it is larger than the sum of its proper divisors (8108254193).
104140400143 is a wasteful number, since it uses less digits than its factorization.
104140400143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6961025.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 104140400143 its reverse (341004041401), we get a palindrome (445144441544).
The spelling of 104140400143 in words is "one hundred four billion, one hundred forty million, four hundred thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •