Base | Representation |
---|---|
bin | 110011001110010000… |
… | …1001111011110100001 |
3 | 101111221002200012111021 |
4 | 1212130201033132201 |
5 | 3300240014022431 |
6 | 122311112445441 |
7 | 10642622532103 |
oct | 1463441173641 |
9 | 344832605437 |
10 | 110000142241 |
11 | 42718237a70 |
12 | 1939a9a9881 |
13 | a4b0549882 |
14 | 547721d573 |
15 | 2cdc124b11 |
hex | 199c84f7a1 |
110000142241 has 8 divisors (see below), whose sum is σ = 120014168544. Its totient is φ = 99988451520.
The previous prime is 110000142157. The next prime is 110000142257. The reversal of 110000142241 is 142241000011.
It is a happy number.
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 110000142241 - 229 = 109463271329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110000142271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 484680 + ... + 674473.
It is an arithmetic number, because the mean of its divisors is an integer number (15001771068).
Almost surely, 2110000142241 is an apocalyptic number.
110000142241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110000142241 is a deficient number, since it is larger than the sum of its proper divisors (10014026303).
110000142241 is a wasteful number, since it uses less digits than its factorization.
110000142241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1167791.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 110000142241 its reverse (142241000011), we get a palindrome (252241142252).
The spelling of 110000142241 in words is "one hundred ten billion, one hundred forty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •