Base | Representation |
---|---|
bin | 100111001101100111… |
… | …001100110011101101 |
3 | 11000200022200121112201 |
4 | 213031213030303231 |
5 | 1142212200423041 |
6 | 31201545301501 |
7 | 3020245511233 |
oct | 471547146355 |
9 | 130608617481 |
10 | 42104311021 |
11 | 16946871063 |
12 | 81b0794891 |
13 | 3c8001c706 |
14 | 2075c5a953 |
15 | 1166601631 |
hex | 9cd9ccced |
42104311021 has 4 divisors (see below), whose sum is σ = 42105330652. Its totient is φ = 42103291392.
The previous prime is 42104311019. The next prime is 42104311031. The reversal of 42104311021 is 12011340124.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14318754921 + 27785556100 = 119661^2 + 166690^2 .
It is a cyclic number.
It is not a de Polignac number, because 42104311021 - 21 = 42104311019 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 42104311021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42104311001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 445140 + ... + 531373.
It is an arithmetic number, because the mean of its divisors is an integer number (10526332663).
Almost surely, 242104311021 is an apocalyptic number.
It is an amenable number.
42104311021 is a deficient number, since it is larger than the sum of its proper divisors (1019631).
42104311021 is an equidigital number, since it uses as much as digits as its factorization.
42104311021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019630.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 42104311021 its reverse (12011340124), we get a palindrome (54115651145).
The spelling of 42104311021 in words is "forty-two billion, one hundred four million, three hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •