Base | Representation |
---|---|
bin | 100111011001101010… |
… | …110100100010011101 |
3 | 11001012102022021201112 |
4 | 213121222310202131 |
5 | 1143120441234111 |
6 | 31234012551405 |
7 | 3025253024414 |
oct | 473152644235 |
9 | 131172267645 |
10 | 42306586781 |
11 | 16a3aa68908 |
12 | 8248482565 |
13 | 3cb2bc2804 |
14 | 2094a7247b |
15 | 1179259e8b |
hex | 9d9ab489d |
42306586781 has 4 divisors (see below), whose sum is σ = 42370785600. Its totient is φ = 42242387964.
The previous prime is 42306586771. The next prime is 42306586799. The reversal of 42306586781 is 18768560324.
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 42306586781 - 26 = 42306586717 is a prime.
It is a super-2 number, since 2×423065867812 (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 (42306586711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32098421 + ... + 32099738.
It is an arithmetic number, because the mean of its divisors is an integer number (10592696400).
Almost surely, 242306586781 is an apocalyptic number.
It is an amenable number.
42306586781 is a deficient number, since it is larger than the sum of its proper divisors (64198819).
42306586781 is an equidigital number, since it uses as much as digits as its factorization.
42306586781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64198818.
The product of its (nonzero) digits is 1935360, while the sum is 50.
The spelling of 42306586781 in words is "forty-two billion, three hundred six million, five hundred eighty-six thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •