Base | Representation |
---|---|
bin | 10011010010101101001111… |
… | …00000010010000011001010 |
3 | 12120012201021121010102101010 |
4 | 21221112213200102003022 |
5 | 21030034231233141302 |
6 | 230121224235304350 |
7 | 11636022165100626 |
oct | 1151264740220312 |
9 | 176181247112333 |
10 | 42424202240202 |
11 | 12577004193562 |
12 | 49121175ab0b6 |
13 | 1a8977b626353 |
14 | a694b1570186 |
15 | 4d883e23216c |
hex | 2695a78120ca |
42424202240202 has 16 divisors (see below), whose sum is σ = 87141604601952. Its totient is φ = 13759200726480.
The previous prime is 42424202240159. The next prime is 42424202240213. The reversal of 42424202240202 is 20204220242424.
It is a super-3 number, since 3×424242022402023 (a number of 42 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 42424202240202.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95550004824 + ... + 95550005267.
It is an arithmetic number, because the mean of its divisors is an integer number (5446350287622).
Almost surely, 242424202240202 is an apocalyptic number.
42424202240202 is an abundant number, since it is smaller than the sum of its proper divisors (44717402361750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42424202240202 is a wasteful number, since it uses less digits than its factorization.
42424202240202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191100010133.
The product of its (nonzero) digits is 32768, while the sum is 30.
Adding to 42424202240202 its reverse (20204220242424), we get a palindrome (62628422482626).
The spelling of 42424202240202 in words is "forty-two trillion, four hundred twenty-four billion, two hundred two million, two hundred forty thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •