Base | Representation |
---|---|
bin | 10000001000111… |
… | …10111000100001 |
3 | 100102202200000012 |
4 | 20010132320201 |
5 | 234130032201 |
6 | 21233534305 |
7 | 3232551125 |
oct | 1004367041 |
9 | 312680005 |
10 | 135392801 |
11 | 6a475685 |
12 | 39414395 |
13 | 220862ab |
14 | 13da5585 |
15 | bd465bb |
hex | 811ee21 |
135392801 has 4 divisors (see below), whose sum is σ = 135416112. Its totient is φ = 135369492.
The previous prime is 135392773. The next prime is 135392809. The reversal of 135392801 is 108293531.
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, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 108293531 = 71 ⋅1525261.
It is a cyclic number.
It is not a de Polignac number, because 135392801 - 26 = 135392737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135392809) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4826 + ... + 17148.
It is an arithmetic number, because the mean of its divisors is an integer number (33854028).
Almost surely, 2135392801 is an apocalyptic number.
It is an amenable number.
135392801 is a deficient number, since it is larger than the sum of its proper divisors (23311).
135392801 is a wasteful number, since it uses less digits than its factorization.
135392801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23310.
The product of its (nonzero) digits is 6480, while the sum is 32.
The square root of 135392801 is about 11635.8412244238. The cubic root of 135392801 is about 513.4898431617.
The spelling of 135392801 in words is "one hundred thirty-five million, three hundred ninety-two thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •