Base | Representation |
---|---|
bin | 10000001110001… |
… | …00111101011011 |
3 | 100111001020010122 |
4 | 20013010331123 |
5 | 234313314201 |
6 | 21300303455 |
7 | 3241413302 |
oct | 1007047533 |
9 | 314036118 |
10 | 136073051 |
11 | 6a89a774 |
12 | 396a1b8b |
13 | 22263aca |
14 | 14101439 |
15 | be2ce1b |
hex | 81c4f5b |
136073051 has 4 divisors (see below), whose sum is σ = 136104432. Its totient is φ = 136041672.
The previous prime is 136073029. The next prime is 136073053. The reversal of 136073051 is 150370631.
It is a happy number.
136073051 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: 150370631 = 107 ⋅1405333.
It is a cyclic number.
It is not a de Polignac number, because 136073051 - 26 = 136072987 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 136073051.
It is not an unprimeable number, because it can be changed into a prime (136073053) 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, 7895 + ... + 18288.
It is an arithmetic number, because the mean of its divisors is an integer number (34026108).
Almost surely, 2136073051 is an apocalyptic number.
136073051 is a deficient number, since it is larger than the sum of its proper divisors (31381).
136073051 is an equidigital number, since it uses as much as digits as its factorization.
136073051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31380.
The product of its (nonzero) digits is 1890, while the sum is 26.
The square root of 136073051 is about 11665.0354050041. The cubic root of 136073051 is about 514.3483774799.
The spelling of 136073051 in words is "one hundred thirty-six million, seventy-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •