Search a number
-
+
135064015631 = 722231870097
BaseRepresentation
bin111110111001001110…
…0010101001100001111
3110220121211202220010022
41331302130111030033
54203102342000011
6142014134332355
712521004122216
oct1756234251417
9426554686108
10135064015631
115230a130016
12222147ba0bb
13c97608809c
146773c7207d
1537a77128db
hex1f7271530f

135064015631 has 4 divisors (see below), whose sum is σ = 135065957952. Its totient is φ = 135062073312.

The previous prime is 135064015627. The next prime is 135064015633. The reversal of 135064015631 is 136510460531.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 136510460531 = 1031325344277.

It is a cyclic number.

It is not a de Polignac number, because 135064015631 - 22 = 135064015627 is a prime.

It is a super-2 number, since 2×1350640156312 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 135064015591 and 135064015600.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (135064015633) 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, 862826 + ... + 1007271.

It is an arithmetic number, because the mean of its divisors is an integer number (33766489488).

Almost surely, 2135064015631 is an apocalyptic number.

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

135064015631 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 1942320.

The product of its (nonzero) digits is 32400, while the sum is 35.

The spelling of 135064015631 in words is "one hundred thirty-five billion, sixty-four million, fifteen thousand, six hundred thirty-one".

Divisors: 1 72223 1870097 135064015631