Base | Representation |
---|---|
bin | 10011001001110111010111… |
… | …00111001110001100101111 |
3 | 12112010200010020210222111121 |
4 | 21210323223213032030233 |
5 | 21010100040432411421 |
6 | 225325502355001411 |
7 | 11605045555453420 |
oct | 1144735347161457 |
9 | 175120106728447 |
10 | 42120402232111 |
11 | 1246a186a8aa05 |
12 | 4883271599267 |
13 | 1a66c24459758 |
14 | a588d1897647 |
15 | 4d09ad154d41 |
hex | 264eeb9ce32f |
42120402232111 has 8 divisors (see below), whose sum is σ = 48137710737024. Its totient is φ = 36103120773720.
The previous prime is 42120402232081. The next prime is 42120402232283. The reversal of 42120402232111 is 11123220402124.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42120402232111 - 213 = 42120402223919 is a prime.
It is a super-2 number, since 2×421204022321112 (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 (42120402232411) 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, 3306805 + ... + 9755806.
It is an arithmetic number, because the mean of its divisors is an integer number (6017213842128).
Almost surely, 242120402232111 is an apocalyptic number.
42120402232111 is a deficient number, since it is larger than the sum of its proper divisors (6017308504913).
42120402232111 is a wasteful number, since it uses less digits than its factorization.
42120402232111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13523261.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 42120402232111 its reverse (11123220402124), we get a palindrome (53243622634235).
The spelling of 42120402232111 in words is "forty-two trillion, one hundred twenty billion, four hundred two million, two hundred thirty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •