Base | Representation |
---|---|
bin | 10011010110011111111011… |
… | …11111010001000100111110 |
3 | 12120200011121102112022212011 |
4 | 21223033331333101010332 |
5 | 21034203110032102032 |
6 | 230301133552201434 |
7 | 11651314143501121 |
oct | 1153177577210476 |
9 | 176604542468764 |
10 | 42554502222142 |
11 | 12617299124549 |
12 | 493342083927a |
13 | 1a98b456c0691 |
14 | a719128063b8 |
15 | 4dbe1859e247 |
hex | 26b3fdfd113e |
42554502222142 has 8 divisors (see below), whose sum is σ = 63832037525136. Its totient is φ = 21277156380432.
The previous prime is 42554502222131. The next prime is 42554502222229. The reversal of 42554502222142 is 24122220545524.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×425545022221423 (a number of 42 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42554502222095 and 42554502222104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46802463 + ... + 47703034.
It is an arithmetic number, because the mean of its divisors is an integer number (7979004690642).
Almost surely, 242554502222142 is an apocalyptic number.
42554502222142 is a deficient number, since it is larger than the sum of its proper divisors (21277535302994).
42554502222142 is a wasteful number, since it uses less digits than its factorization.
42554502222142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94730642.
The product of its (nonzero) digits is 512000, while the sum is 40.
Adding to 42554502222142 its reverse (24122220545524), we get a palindrome (66676722767666).
The spelling of 42554502222142 in words is "forty-two trillion, five hundred fifty-four billion, five hundred two million, two hundred twenty-two thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •