Base | Representation |
---|---|
bin | 10011001100100000010101… |
… | …11100001011110000011001 |
3 | 12112110100021200022111102101 |
4 | 21212100022330023300121 |
5 | 21013041334231242131 |
6 | 225435304413203401 |
7 | 11614436646061420 |
oct | 1146201274136031 |
9 | 175410250274371 |
10 | 42211122134041 |
11 | 124a4700003a73 |
12 | 489896b490561 |
13 | 1a726514689b3 |
14 | a5d05a2302b7 |
15 | 4d301c7d5c61 |
hex | 26640af0bc19 |
42211122134041 has 8 divisors (see below), whose sum is σ = 48783319320960. Its totient is φ = 35774434167648.
The previous prime is 42211122134039. The next prime is 42211122134107. The reversal of 42211122134041 is 14043122111224.
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 42211122134041 - 21 = 42211122134039 is a prime.
It is a super-3 number, since 3×422111221340413 (a number of 42 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (42211122132041) 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, 33877304461 + ... + 33877305706.
It is an arithmetic number, because the mean of its divisors is an integer number (6097914915120).
Almost surely, 242211122134041 is an apocalyptic number.
It is an amenable number.
42211122134041 is a deficient number, since it is larger than the sum of its proper divisors (6572197186919).
42211122134041 is an equidigital number, since it uses as much as digits as its factorization.
42211122134041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67754610263.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 42211122134041 its reverse (14043122111224), we get a palindrome (56254244245265).
The spelling of 42211122134041 in words is "forty-two trillion, two hundred eleven billion, one hundred twenty-two million, one hundred thirty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •