Base | Representation |
---|---|
bin | 10000001101101… |
… | …10011000011101 |
3 | 100110221012020011 |
4 | 20012312120131 |
5 | 234304411331 |
6 | 21255123221 |
7 | 3241044232 |
oct | 1006663035 |
9 | 313835204 |
10 | 136013341 |
11 | 6a859922 |
12 | 39673511 |
13 | 22242889 |
14 | 140c7789 |
15 | be1a3b1 |
hex | 81b661d |
136013341 has 4 divisors (see below), whose sum is σ = 136067932. Its totient is φ = 135958752.
The previous prime is 136013323. The next prime is 136013363. The reversal of 136013341 is 143310631.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 93045316 + 42968025 = 9646^2 + 6555^2 .
It is a cyclic number.
It is not a de Polignac number, because 136013341 - 215 = 135980573 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136013041) 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 3 ways as a sum of consecutive naturals, for example, 23370 + ... + 28603.
It is an arithmetic number, because the mean of its divisors is an integer number (34016983).
Almost surely, 2136013341 is an apocalyptic number.
It is an amenable number.
136013341 is a deficient number, since it is larger than the sum of its proper divisors (54591).
136013341 is an equidigital number, since it uses as much as digits as its factorization.
136013341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54590.
The product of its (nonzero) digits is 648, while the sum is 22.
The square root of 136013341 is about 11662.4757663199. The cubic root of 136013341 is about 514.2731330072.
Adding to 136013341 its reverse (143310631), we get a palindrome (279323972).
The spelling of 136013341 in words is "one hundred thirty-six million, thirteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •