Search a number
-
+
42102567 = 3213359851
BaseRepresentation
bin1010000010011…
…0111100100111
32221020000212100
42200212330213
541234240232
64102223143
71020603003
oct240467447
987200770
1042102567
1121847311
1212124ab3
138951880
14583d703
153a69c7c
hex2826f27

42102567 has 12 divisors (see below), whose sum is σ = 65493064. Its totient is φ = 25909200.

The previous prime is 42102563. The next prime is 42102583. The reversal of 42102567 is 76520124.

42102567 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 42102567 - 22 = 42102563 is a prime.

It is a super-3 number, since 3×421025673 (a number of 24 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a self number, because there is not a number n which added to its sum of digits gives 42102567.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (42102563) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 179809 + ... + 180042.

Almost surely, 242102567 is an apocalyptic number.

42102567 is a deficient number, since it is larger than the sum of its proper divisors (23390497).

42102567 is a wasteful number, since it uses less digits than its factorization.

42102567 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 359870 (or 359867 counting only the distinct ones).

The product of its (nonzero) digits is 3360, while the sum is 27.

The square root of 42102567 is about 6488.6490889861. The cubic root of 42102567 is about 347.8853913122.

The spelling of 42102567 in words is "forty-two million, one hundred two thousand, five hundred sixty-seven".

Divisors: 1 3 9 13 39 117 359851 1079553 3238659 4678063 14034189 42102567