Base | Representation |
---|---|
bin | 10000000100001100111… |
… | …110100100100101000101 |
3 | 10220112200100112122000101 |
4 | 100010030332210211011 |
5 | 121042020211340141 |
6 | 2203103132444101 |
7 | 142522515630544 |
oct | 20041476444505 |
9 | 3815610478011 |
10 | 1104024324421 |
11 | 396239a49547 |
12 | 159b73619631 |
13 | 80155765525 |
14 | 3b613b5015b |
15 | 1dab8e2d531 |
hex | 1010cfa4945 |
1104024324421 has 8 divisors (see below), whose sum is σ = 1135625823360. Its totient is φ = 1072760809728.
The previous prime is 1104024324401. The next prime is 1104024324511. The reversal of 1104024324421 is 1244234204011.
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-1104024324421 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1104024324421.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104024324401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84489436 + ... + 84502501.
It is an arithmetic number, because the mean of its divisors is an integer number (141953227920).
Almost surely, 21104024324421 is an apocalyptic number.
It is an amenable number.
1104024324421 is a deficient number, since it is larger than the sum of its proper divisors (31601498939).
1104024324421 is a wasteful number, since it uses less digits than its factorization.
1104024324421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168992123.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 1104024324421 its reverse (1244234204011), we get a palindrome (2348258528432).
The spelling of 1104024324421 in words is "one trillion, one hundred four billion, twenty-four million, three hundred twenty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •