Base | Representation |
---|---|
bin | 10011001100100000100010… |
… | …00010000100101110111000 |
3 | 12112110100112210122011121022 |
4 | 21212100101002010232320 |
5 | 21013042041412411212 |
6 | 225435322504002012 |
7 | 11614442326606226 |
oct | 1146202102045670 |
9 | 175410483564538 |
10 | 42211224341432 |
11 | 124a4752772993 |
12 | 4898999760308 |
13 | 1a726696a3143 |
14 | a5d069a37b16 |
15 | 4d3026774772 |
hex | 266411084bb8 |
42211224341432 has 16 divisors (see below), whose sum is σ = 79146794390400. Its totient is φ = 21105412504000.
The previous prime is 42211224341411. The next prime is 42211224341471. The reversal of 42211224341432 is 23414342211224.
It is a super-2 number, since 2×422112243414322 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42211224341392 and 42211224341401.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24057944 + ... + 25752807.
It is an arithmetic number, because the mean of its divisors is an integer number (4946674649400).
Almost surely, 242211224341432 is an apocalyptic number.
It is an amenable number.
42211224341432 is a deficient number, since it is larger than the sum of its proper divisors (36935570048968).
42211224341432 is a wasteful number, since it uses less digits than its factorization.
42211224341432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49916686 (or 49916682 counting only the distinct ones).
The product of its digits is 73728, while the sum is 35.
Adding to 42211224341432 its reverse (23414342211224), we get a palindrome (65625566552656).
The spelling of 42211224341432 in words is "forty-two trillion, two hundred eleven billion, two hundred twenty-four million, three hundred forty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •