Base | Representation |
---|---|
bin | 10011010010111111111100… |
… | …00100001100110111001111 |
3 | 12120020200012110021120211011 |
4 | 21221133332010030313033 |
5 | 21030220313033300221 |
6 | 230130004530310051 |
7 | 11636526064235005 |
oct | 1151377604146717 |
9 | 176220173246734 |
10 | 42434244431311 |
11 | 125802977a5357 |
12 | 491405a728327 |
13 | 1a8a6bbc96775 |
14 | a69b85156a75 |
15 | 4d8c2ab761e1 |
hex | 2697fe10cdcf |
42434244431311 has 8 divisors (see below), whose sum is σ = 43018223930784. Its totient is φ = 41850337593600.
The previous prime is 42434244431251. The next prime is 42434244431323. The reversal of 42434244431311 is 11313444243424.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 42434244431311 - 211 = 42434244429263 is a prime.
It is a super-2 number, since 2×424342444313112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42434244431611) 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, 16988890 + ... + 19325911.
It is an arithmetic number, because the mean of its divisors is an integer number (5377277991348).
Almost surely, 242434244431311 is an apocalyptic number.
42434244431311 is a deficient number, since it is larger than the sum of its proper divisors (583979499473).
42434244431311 is a wasteful number, since it uses less digits than its factorization.
42434244431311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36330881.
The product of its digits is 442368, while the sum is 40.
Adding to 42434244431311 its reverse (11313444243424), we get a palindrome (53747688674735).
The spelling of 42434244431311 in words is "forty-two trillion, four hundred thirty-four billion, two hundred forty-four million, four hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •