Base | Representation |
---|---|
bin | 1100110111110111100… |
… | …10111100111101110001 |
3 | 1120021200102101001212120 |
4 | 12123323302330331301 |
5 | 24221323120233241 |
6 | 535110033544453 |
7 | 43645611223314 |
oct | 6337362747561 |
9 | 1507612331776 |
10 | 442311102321 |
11 | 1606460a4860 |
12 | 71881115129 |
13 | 3292c45226a |
14 | 1759d68c97b |
15 | b78b246666 |
hex | 66fbcbcf71 |
442311102321 has 8 divisors (see below), whose sum is σ = 643361603424. Its totient is φ = 268067334720.
The previous prime is 442311102301. The next prime is 442311102349. The reversal of 442311102321 is 123201113244.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-442311102321 is a prime.
It is a super-2 number, since 2×4423111023212 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 442311102291 and 442311102300.
It is not an unprimeable number, because it can be changed into a prime (442311102301) 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, 6701683336 + ... + 6701683401.
It is an arithmetic number, because the mean of its divisors is an integer number (80420200428).
Almost surely, 2442311102321 is an apocalyptic number.
It is an amenable number.
442311102321 is a deficient number, since it is larger than the sum of its proper divisors (201050501103).
442311102321 is a wasteful number, since it uses less digits than its factorization.
442311102321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13403366751.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 442311102321 its reverse (123201113244), we get a palindrome (565512215565).
The spelling of 442311102321 in words is "four hundred forty-two billion, three hundred eleven million, one hundred two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •