Base | Representation |
---|---|
bin | 10011001101011011111101… |
… | …10000111011110110100001 |
3 | 12112120101220100222022200220 |
4 | 21212231332300323312201 |
5 | 21014102412302112231 |
6 | 225502120455233253 |
7 | 11616652100314545 |
oct | 1146557660736641 |
9 | 175511810868626 |
10 | 42243130113441 |
11 | 12507235744704 |
12 | 48a3002978829 |
13 | 1a7568284008a |
14 | a6081520da25 |
15 | 4d3c9284b896 |
hex | 266b7ec3bda1 |
42243130113441 has 8 divisors (see below), whose sum is σ = 59637360160224. Its totient is φ = 26505493404480.
The previous prime is 42243130113403. The next prime is 42243130113451. The reversal of 42243130113441 is 14431103134224.
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 42243130113441 - 29 = 42243130112929 is a prime.
It is a super-2 number, since 2×422431301134412 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (42243130113451) 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, 414148334395 + ... + 414148334496.
It is an arithmetic number, because the mean of its divisors is an integer number (7454670020028).
Almost surely, 242243130113441 is an apocalyptic number.
It is an amenable number.
42243130113441 is a deficient number, since it is larger than the sum of its proper divisors (17394230046783).
42243130113441 is a wasteful number, since it uses less digits than its factorization.
42243130113441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 828296668911.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 42243130113441 its reverse (14431103134224), we get a palindrome (56674233247665).
The spelling of 42243130113441 in words is "forty-two trillion, two hundred forty-three billion, one hundred thirty million, one hundred thirteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •