Base | Representation |
---|---|
bin | 10011001001100101111101… |
… | …10011111110011110111111 |
3 | 12112002210000020000021021210 |
4 | 21210302332303332132333 |
5 | 21004421423012310203 |
6 | 225321315412455503 |
7 | 11604265224453606 |
oct | 1144627663763677 |
9 | 175083006007253 |
10 | 42111060666303 |
11 | 12466222a05292 |
12 | 48814a501a593 |
13 | 1a66095cb7215 |
14 | a58286d6ca3d |
15 | 4d0612ea8803 |
hex | 264cbecfe7bf |
42111060666303 has 4 divisors (see below), whose sum is σ = 56148080888408. Its totient is φ = 28074040444200.
The previous prime is 42111060666253. The next prime is 42111060666343. The reversal of 42111060666303 is 30366606011124.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 42111060666303 - 210 = 42111060665279 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42111060666343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7018510111048 + ... + 7018510111053.
It is an arithmetic number, because the mean of its divisors is an integer number (14037020222102).
Almost surely, 242111060666303 is an apocalyptic number.
42111060666303 is a deficient number, since it is larger than the sum of its proper divisors (14037020222105).
42111060666303 is a wasteful number, since it uses less digits than its factorization.
42111060666303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14037020222104.
The product of its (nonzero) digits is 93312, while the sum is 39.
Adding to 42111060666303 its reverse (30366606011124), we get a palindrome (72477666677427).
The spelling of 42111060666303 in words is "forty-two trillion, one hundred eleven billion, sixty million, six hundred sixty-six thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •