Base | Representation |
---|---|
bin | 10011000111010001000100… |
… | …00110100110001100011111 |
3 | 12111211010200011112000201221 |
4 | 21203220202012212030133 |
5 | 21002114214230111221 |
6 | 225220455252114211 |
7 | 11565435250124032 |
oct | 1143504206461437 |
9 | 174733604460657 |
10 | 42031122113311 |
11 | 12435331758261 |
12 | 4869ab5905967 |
13 | 1a5b696817ba6 |
14 | a5446242b019 |
15 | 4cd4d50c6541 |
hex | 263a221a631f |
42031122113311 has 8 divisors (see below), whose sum is σ = 42075542907648. Its totient is φ = 41986703655000.
The previous prime is 42031122113287. The next prime is 42031122113341. The reversal of 42031122113311 is 11331122113024.
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 42031122113311 - 29 = 42031122112799 is a prime.
It is a super-2 number, since 2×420311221133112 (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 (42031122113341) 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, 36674476 + ... + 37803166.
It is an arithmetic number, because the mean of its divisors is an integer number (5259442863456).
Almost surely, 242031122113311 is an apocalyptic number.
42031122113311 is a deficient number, since it is larger than the sum of its proper divisors (44420794337).
42031122113311 is a wasteful number, since it uses less digits than its factorization.
42031122113311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1168013.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 42031122113311 its reverse (11331122113024), we get a palindrome (53362244226335).
The spelling of 42031122113311 in words is "forty-two trillion, thirty-one billion, one hundred twenty-two million, one hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •