Base | Representation |
---|---|
bin | 10011001101000000000110… |
… | …11001010010101011101001 |
3 | 12112111222022011001222111102 |
4 | 21212200003121102223221 |
5 | 21013331300401303131 |
6 | 225451204520211145 |
7 | 11615612360426636 |
oct | 1146400331225351 |
9 | 175458264058442 |
10 | 42228175416041 |
11 | 1250096115515a |
12 | 48a012a609ab5 |
13 | 1a7413b4c62c4 |
14 | a5dbd701d18d |
15 | 4d36b99d51cb |
hex | 266803652ae9 |
42228175416041 has 4 divisors (see below), whose sum is σ = 42278506972800. Its totient is φ = 42177843859284.
The previous prime is 42228175416029. The next prime is 42228175416071. The reversal of 42228175416041 is 14061457182224.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 42228175416041 - 230 = 42227101674217 is a prime.
It is a super-2 number, since 2×422281754160412 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42228175416071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25165777121 + ... + 25165778798.
It is an arithmetic number, because the mean of its divisors is an integer number (10569626743200).
Almost surely, 242228175416041 is an apocalyptic number.
It is an amenable number.
42228175416041 is a deficient number, since it is larger than the sum of its proper divisors (50331556759).
42228175416041 is an equidigital number, since it uses as much as digits as its factorization.
42228175416041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50331556758.
The product of its (nonzero) digits is 860160, while the sum is 47.
The spelling of 42228175416041 in words is "forty-two trillion, two hundred twenty-eight billion, one hundred seventy-five million, four hundred sixteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •