Base | Representation |
---|---|
bin | 110000011111101011… |
… | …1000111111001111001 |
3 | 100221210212000000012220 |
4 | 1200333113013321321 |
5 | 3201240403211101 |
6 | 115501533354253 |
7 | 10344512306022 |
oct | 1407727077171 |
9 | 327725000186 |
10 | 104142241401 |
11 | 40191642400 |
12 | 18225038989 |
13 | 9a88a44763 |
14 | 507d23dc49 |
15 | 2a97c0a636 |
hex | 183f5c7e79 |
104142241401 has 48 divisors (see below), whose sum is σ = 158306320704. Its totient is φ = 60801840000.
The previous prime is 104142241391. The next prime is 104142241447.
104142241401 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 104142241401 - 211 = 104142239353 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (104142241481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1318146 + ... + 1394916.
It is an arithmetic number, because the mean of its divisors is an integer number (3298048348).
Almost surely, 2104142241401 is an apocalyptic number.
104142241401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
104142241401 is a deficient number, since it is larger than the sum of its proper divisors (54164079303).
104142241401 is a wasteful number, since it uses less digits than its factorization.
104142241401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76934 (or 76923 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 24.
It can be divided in two parts, 104142 and 241401, that added together give a palindrome (345543).
The spelling of 104142241401 in words is "one hundred four billion, one hundred forty-two million, two hundred forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.997 sec. • engine limits •