Base | Representation |
---|---|
bin | 100111011010101001… |
… | …110101000100010101 |
3 | 11001020120101110010011 |
4 | 213122221311010111 |
5 | 1143134203312041 |
6 | 31235403000221 |
7 | 3025543306552 |
oct | 473251650425 |
9 | 131216343104 |
10 | 42323104021 |
11 | 16a4931a520 |
12 | 8251b09071 |
13 | 3cb6456923 |
14 | 2096d31a29 |
15 | 117a91de81 |
hex | 9daa75115 |
42323104021 has 8 divisors (see below), whose sum is σ = 46190325888. Its totient is φ = 38459160000.
The previous prime is 42323104013. The next prime is 42323104039. The reversal of 42323104021 is 12040132324.
42323104021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 42323104021 - 23 = 42323104013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42323103983 and 42323104001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42323104921) 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, 792420 + ... + 844141.
It is an arithmetic number, because the mean of its divisors is an integer number (5773790736).
Almost surely, 242323104021 is an apocalyptic number.
It is an amenable number.
42323104021 is a deficient number, since it is larger than the sum of its proper divisors (3867221867).
42323104021 is a wasteful number, since it uses less digits than its factorization.
42323104021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1638923.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 42323104021 its reverse (12040132324), we get a palindrome (54363236345).
The spelling of 42323104021 in words is "forty-two billion, three hundred twenty-three million, one hundred four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •