Base | Representation |
---|---|
bin | 110000011011100000… |
… | …0001010010100010001 |
3 | 100221110002010020000000 |
4 | 1200313000022110101 |
5 | 3200444003113431 |
6 | 115440003520213 |
7 | 10341160310232 |
oct | 1406700122421 |
9 | 327402106000 |
10 | 104002004241 |
11 | 4011a469123 |
12 | 181a6089069 |
13 | 9a659834a5 |
14 | 5068777089 |
15 | 2a8a7589e6 |
hex | 183700a511 |
104002004241 has 16 divisors (see below), whose sum is σ = 155979232320. Its totient is φ = 69334668036.
The previous prime is 104002004207. The next prime is 104002004287. The reversal of 104002004241 is 142400200401.
104002004241 is a `hidden beast` number, since 1 + 0 + 40 + 0 + 200 + 424 + 1 = 666.
It is not a de Polignac number, because 104002004241 - 215 = 104001971473 is a prime.
It is a super-2 number, since 2×1040020042412 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (104002003241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23775135 + ... + 23779508.
It is an arithmetic number, because the mean of its divisors is an integer number (9748702020).
Almost surely, 2104002004241 is an apocalyptic number.
It is an amenable number.
104002004241 is a deficient number, since it is larger than the sum of its proper divisors (51977228079).
104002004241 is an frugal number, since it uses more digits than its factorization.
104002004241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47554664 (or 47554646 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 104002004241 its reverse (142400200401), we get a palindrome (246402204642).
The spelling of 104002004241 in words is "one hundred four billion, two million, four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •