Base | Representation |
---|---|
bin | 100000111010000… |
… | …1111011111110001 |
3 | 2211221202212211212 |
4 | 1001310033133301 |
5 | 4230134322001 |
6 | 301323045505 |
7 | 36235443542 |
oct | 10164173761 |
9 | 2757685755 |
10 | 1104214001 |
11 | 517333360 |
12 | 269970895 |
13 | 1479c7a87 |
14 | a69184c9 |
15 | 66e197bb |
hex | 41d0f7f1 |
1104214001 has 8 divisors (see below), whose sum is σ = 1206830208. Its totient is φ = 1001970000.
The previous prime is 1104213991. The next prime is 1104214003. The reversal of 1104214001 is 1004124011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1104214001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1104214003) 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, 86825 + ... + 98726.
It is an arithmetic number, because the mean of its divisors is an integer number (150853776).
Almost surely, 21104214001 is an apocalyptic number.
1104214001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1104214001 is a deficient number, since it is larger than the sum of its proper divisors (102616207).
1104214001 is a wasteful number, since it uses less digits than its factorization.
1104214001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186103.
The product of its (nonzero) digits is 32, while the sum is 14.
The square root of 1104214001 is about 33229.7156322470. The cubic root of 1104214001 is about 1033.5966264788.
Adding to 1104214001 its reverse (1004124011), we get a palindrome (2108338012).
The spelling of 1104214001 in words is "one billion, one hundred four million, two hundred fourteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •