Base | Representation |
---|---|
bin | 100111100001101100… |
… | …100100001111100101 |
3 | 11001112210201111110120 |
4 | 213201230210033211 |
5 | 1143404430341203 |
6 | 31255223312153 |
7 | 3031506526611 |
oct | 474154441745 |
9 | 131483644416 |
10 | 42441262053 |
11 | 16aa9a93393 |
12 | 82855ab659 |
13 | 4004a87318 |
14 | 20a88cc341 |
15 | 1185eadb53 |
hex | 9e1b243e5 |
42441262053 has 8 divisors (see below), whose sum is σ = 57968553216. Its totient is φ = 27604072800.
The previous prime is 42441262051. The next prime is 42441262079. The reversal of 42441262053 is 35026214424.
42441262053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42441262053 - 21 = 42441262051 is a prime.
It is a super-3 number, since 3×424412620533 (a number of 33 digits) contains 333 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42441262051) 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, 172525333 + ... + 172525578.
It is an arithmetic number, because the mean of its divisors is an integer number (7246069152).
Almost surely, 242441262053 is an apocalyptic number.
It is an amenable number.
42441262053 is a deficient number, since it is larger than the sum of its proper divisors (15527291163).
42441262053 is a wasteful number, since it uses less digits than its factorization.
42441262053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 345050955.
The product of its (nonzero) digits is 46080, while the sum is 33.
Adding to 42441262053 its reverse (35026214424), we get a palindrome (77467476477).
The spelling of 42441262053 in words is "forty-two billion, four hundred forty-one million, two hundred sixty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •