Base | Representation |
---|---|
bin | 10011000110011011011010… |
… | …11111000010110100000000 |
3 | 12111201101100001002211020021 |
4 | 21203031231133002310000 |
5 | 21001131223420321422 |
6 | 225155333402423224 |
7 | 11563365460425625 |
oct | 1143155537026400 |
9 | 174641301084207 |
10 | 42002322042112 |
11 | 124240a2881523 |
12 | 48643b8801b14 |
13 | 1a58a56c20a43 |
14 | a52ccd4d434c |
15 | 4cc89b9c1dc7 |
hex | 26336d7c2d00 |
42002322042112 has 72 divisors (see below), whose sum is σ = 85454100972576. Its totient is φ = 20597282973696.
The previous prime is 42002322042061. The next prime is 42002322042133. The reversal of 42002322042112 is 21124022320024.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36156783 + ... + 37300369.
It is an arithmetic number, because the mean of its divisors is an integer number (1186862513508).
Almost surely, 242002322042112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42002322042112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42727050486288).
42002322042112 is an abundant number, since it is smaller than the sum of its proper divisors (43451778930464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42002322042112 is a wasteful number, since it uses less digits than its factorization.
42002322042112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1146363 (or 1146349 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 42002322042112 its reverse (21124022320024), we get a palindrome (63126344362136).
The spelling of 42002322042112 in words is "forty-two trillion, two billion, three hundred twenty-two million, forty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •