Base | Representation |
---|---|
bin | 10011001100001110010011… |
… | …11010011110110010111111 |
3 | 12112102102021222222211022010 |
4 | 21212013021322132302333 |
5 | 21012412022423442421 |
6 | 225431024030022303 |
7 | 11613645024556365 |
oct | 1146071172366277 |
9 | 175372258884263 |
10 | 42201441234111 |
11 | 124a0592429625 |
12 | 4896b09347993 |
13 | 1a7176a905c43 |
14 | a5c7bc613635 |
15 | 4d2b5295b076 |
hex | 2661c9e9ecbf |
42201441234111 has 8 divisors (see below), whose sum is σ = 56276945473840. Its totient is φ = 28130115575232.
The previous prime is 42201441234089. The next prime is 42201441234137. The reversal of 42201441234111 is 11143214410224.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42201441234111 - 211 = 42201441232063 is a prime.
It is a super-2 number, since 2×422014412341112 (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 (42201441234011) 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, 1044621646 + ... + 1044662043.
It is an arithmetic number, because the mean of its divisors is an integer number (7034618184230).
Almost surely, 242201441234111 is an apocalyptic number.
42201441234111 is a deficient number, since it is larger than the sum of its proper divisors (14075504239729).
42201441234111 is a wasteful number, since it uses less digits than its factorization.
42201441234111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2089290425.
The product of its (nonzero) digits is 6144, while the sum is 30.
Adding to 42201441234111 its reverse (11143214410224), we get a palindrome (53344655644335).
The spelling of 42201441234111 in words is "forty-two trillion, two hundred one billion, four hundred forty-one million, two hundred thirty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •