Base | Representation |
---|---|
bin | 10011001101011010100111… |
… | …11001101111010111111111 |
3 | 12112120100001020211122100111 |
4 | 21212231103321233113333 |
5 | 21014044424204020333 |
6 | 225501521250210451 |
7 | 11616625216053040 |
oct | 1146552371572777 |
9 | 175510036748314 |
10 | 42242411001343 |
11 | 125069a6831093 |
12 | 48a2a41b83a27 |
13 | 1a7559986b767 |
14 | a607878dc8c7 |
15 | 4d3c4e6514cd |
hex | 266b53e6f5ff |
42242411001343 has 8 divisors (see below), whose sum is σ = 48277083468960. Its totient is φ = 36207749114880.
The previous prime is 42242411001319. The next prime is 42242411001361. The reversal of 42242411001343 is 34310011424224.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42242411001343 - 25 = 42242411001311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42242411001143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9834783 + ... + 13461343.
It is an arithmetic number, because the mean of its divisors is an integer number (6034635433620).
Almost surely, 242242411001343 is an apocalyptic number.
42242411001343 is a deficient number, since it is larger than the sum of its proper divisors (6034672467617).
42242411001343 is a wasteful number, since it uses less digits than its factorization.
42242411001343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5290577.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 42242411001343 its reverse (34310011424224), we get a palindrome (76552422425567).
The spelling of 42242411001343 in words is "forty-two trillion, two hundred forty-two billion, four hundred eleven million, one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •