Base | Representation |
---|---|
bin | 10000010011110… |
… | …00111111010101 |
3 | 100112102200122211 |
4 | 20021320333111 |
5 | 240010413303 |
6 | 21324153421 |
7 | 3250604203 |
oct | 1011707725 |
9 | 315380584 |
10 | 136810453 |
11 | 7025379a |
12 | 39998871 |
13 | 22461640 |
14 | 14254073 |
15 | c02666d |
hex | 8278fd5 |
136810453 has 4 divisors (see below), whose sum is σ = 147334348. Its totient is φ = 126286560.
The previous prime is 136810451. The next prime is 136810493. The reversal of 136810453 is 354018631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 354018631 = 29 ⋅12207539.
It can be written as a sum of positive squares in 2 ways, for example, as 49238289 + 87572164 = 7017^2 + 9358^2 .
It is a cyclic number.
It is not a de Polignac number, because 136810453 - 21 = 136810451 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 (136810451) 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, 5261928 + ... + 5261953.
It is an arithmetic number, because the mean of its divisors is an integer number (36833587).
Almost surely, 2136810453 is an apocalyptic number.
136810453 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
136810453 is a deficient number, since it is larger than the sum of its proper divisors (10523895).
136810453 is a wasteful number, since it uses less digits than its factorization.
136810453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10523894.
The product of its (nonzero) digits is 8640, while the sum is 31.
The square root of 136810453 is about 11696.6000615563. The cubic root of 136810453 is about 515.2758166882.
The spelling of 136810453 in words is "one hundred thirty-six million, eight hundred ten thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •