Base | Representation |
---|---|
bin | 10000001101111… |
… | …10101110001001 |
3 | 100110222221002012 |
4 | 20012332232021 |
5 | 234312004442 |
6 | 21255545305 |
7 | 3241245635 |
oct | 1006765611 |
9 | 313887065 |
10 | 136047497 |
11 | 6a882553 |
12 | 3968b235 |
13 | 222552a1 |
14 | 140d5dc5 |
15 | be25582 |
hex | 81beb89 |
136047497 has 4 divisors (see below), whose sum is σ = 140738820. Its totient is φ = 131356176.
The previous prime is 136047493. The next prime is 136047503. The reversal of 136047497 is 794740631.
136047497 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 794740631 = 4283 ⋅185557.
It can be written as a sum of positive squares in 2 ways, for example, as 50965321 + 85082176 = 7139^2 + 9224^2 .
It is a cyclic number.
It is not a de Polignac number, because 136047497 - 22 = 136047493 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136047491) 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, 2345618 + ... + 2345675.
It is an arithmetic number, because the mean of its divisors is an integer number (35184705).
Almost surely, 2136047497 is an apocalyptic number.
It is an amenable number.
136047497 is a deficient number, since it is larger than the sum of its proper divisors (4691323).
136047497 is an equidigital number, since it uses as much as digits as its factorization.
136047497 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4691322.
The product of its (nonzero) digits is 127008, while the sum is 41.
The square root of 136047497 is about 11663.9400289953. The cubic root of 136047497 is about 514.3161779096.
The spelling of 136047497 in words is "one hundred thirty-six million, forty-seven thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •