Base | Representation |
---|---|
bin | 100111011111111001… |
… | …111011010100101111 |
3 | 11001110201011200211201 |
4 | 213133321323110233 |
5 | 1143324232210111 |
6 | 31252231230331 |
7 | 3030663223441 |
oct | 473771732457 |
9 | 131421150751 |
10 | 42411210031 |
11 | 16a94027903 |
12 | 82775183a7 |
13 | 3ccb794768 |
14 | 20a4908491 |
15 | 11835246c1 |
hex | 9dfe7b52f |
42411210031 has 8 divisors (see below), whose sum is σ = 44645353200. Its totient is φ = 40177264320.
The previous prime is 42411210029. The next prime is 42411210067. The reversal of 42411210031 is 13001211424.
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 42411210031 - 21 = 42411210029 is a prime.
It is a super-2 number, since 2×424112100312 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42411209990 and 42411210008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42411210431) 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, 634725 + ... + 698353.
It is an arithmetic number, because the mean of its divisors is an integer number (5580669150).
Almost surely, 242411210031 is an apocalyptic number.
42411210031 is a deficient number, since it is larger than the sum of its proper divisors (2234143169).
42411210031 is a wasteful number, since it uses less digits than its factorization.
42411210031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98729.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 42411210031 its reverse (13001211424), we get a palindrome (55412421455).
The spelling of 42411210031 in words is "forty-two billion, four hundred eleven million, two hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •