Search a number
-
+
135678023469 = 3272072091763
BaseRepresentation
bin111111001011100001…
…0100101011100101101
3110222012122010201112100
41332113002211130231
54210332033222334
6142155110525313
712542141112432
oct1762702453455
9428178121470
10135678023469
11525a478620a
1222366366839
13ca43349831
1467d1623b89
1537e159ac99
hex1f970a572d

135678023469 has 12 divisors (see below), whose sum is σ = 196006653856. Its totient is φ = 90439421832.

The previous prime is 135678023401. The next prime is 135678023491. The reversal of 135678023469 is 964320876531.

135678023469 is a `hidden beast` number, since 13 + 567 + 8 + 0 + 2 + 3 + 4 + 69 = 666.

It is not a de Polignac number, because 135678023469 - 29 = 135678022957 is a prime.

It is a super-2 number, since 2×1356780234692 (a number of 23 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 (135678023269) by changing a digit.

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

It is a 2-persistent number, because it is pandigital, and so is 2⋅135678023469 = 271356046938, but 3⋅135678023469 = 407034070407 is not.

Almost surely, 2135678023469 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 6531840, while the sum is 54.

The spelling of 135678023469 in words is "one hundred thirty-five billion, six hundred seventy-eight million, twenty-three thousand, four hundred sixty-nine".

Divisors: 1 3 9 7207 21621 64863 2091763 6275289 18825867 15075335941 45226007823 135678023469