Base | Representation |
---|---|
bin | 100111011001111111… |
… | …010101100111111101 |
3 | 11001012210102112111112 |
4 | 213121333111213331 |
5 | 1143123330341211 |
6 | 31234324131405 |
7 | 3025346525033 |
oct | 473177254775 |
9 | 131183375445 |
10 | 42311965181 |
11 | 16a43001772 |
12 | 824a236b65 |
13 | 3cb40568b5 |
14 | 2095672553 |
15 | 117996d88b |
hex | 9d9fd59fd |
42311965181 has 4 divisors (see below), whose sum is σ = 42312377052. Its totient is φ = 42311553312.
The previous prime is 42311965177. The next prime is 42311965183. The reversal of 42311965181 is 18156911324.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 10740005956 + 31571959225 = 103634^2 + 177685^2 .
It is a cyclic number.
It is not a de Polignac number, because 42311965181 - 22 = 42311965177 is a prime.
It is a super-2 number, since 2×423119651812 (a number of 22 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 (42311965183) 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, 88175 + ... + 303971.
It is an arithmetic number, because the mean of its divisors is an integer number (10578094263).
Almost surely, 242311965181 is an apocalyptic number.
It is an amenable number.
42311965181 is a deficient number, since it is larger than the sum of its proper divisors (411871).
42311965181 is a wasteful number, since it uses less digits than its factorization.
42311965181 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411870.
The product of its digits is 51840, while the sum is 41.
The spelling of 42311965181 in words is "forty-two billion, three hundred eleven million, nine hundred sixty-five thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •