Base | Representation |
---|---|
bin | 111110111001001110… |
… | …0010101001100001111 |
3 | 110220121211202220010022 |
4 | 1331302130111030033 |
5 | 4203102342000011 |
6 | 142014134332355 |
7 | 12521004122216 |
oct | 1756234251417 |
9 | 426554686108 |
10 | 135064015631 |
11 | 5230a130016 |
12 | 222147ba0bb |
13 | c97608809c |
14 | 6773c7207d |
15 | 37a77128db |
hex | 1f7271530f |
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 = 103 ⋅1325344277.
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •