Base | Representation |
---|---|
bin | 11111000101101110000… |
… | …011011101000010010101 |
3 | 21120020112112110101201202 |
4 | 133011232003131002111 |
5 | 240000414424121422 |
6 | 4313245214002245 |
7 | 310232050050224 |
oct | 37055603350225 |
9 | 7506475411652 |
10 | 2136445145237 |
11 | 754074650a27 |
12 | 2a60831a6385 |
13 | 1266097c19c0 |
14 | 75593d20cbb |
15 | 3a891aa8b92 |
hex | 1f16e0dd095 |
2136445145237 has 4 divisors (see below), whose sum is σ = 2300787079500. Its totient is φ = 1972103210976.
The previous prime is 2136445145179. The next prime is 2136445145273. The reversal of 2136445145237 is 7325415446312.
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 348659544676 + 1787785600561 = 590474^2 + 1337081^2 .
It is a cyclic number.
It is not a de Polignac number, because 2136445145237 - 210 = 2136445144213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2136445145191 and 2136445145200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2136445145287) 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, 82170967112 + ... + 82170967137.
It is an arithmetic number, because the mean of its divisors is an integer number (575196769875).
Almost surely, 22136445145237 is an apocalyptic number.
It is an amenable number.
2136445145237 is a deficient number, since it is larger than the sum of its proper divisors (164341934263).
2136445145237 is a wasteful number, since it uses less digits than its factorization.
2136445145237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164341934262.
The product of its digits is 2419200, while the sum is 47.
The spelling of 2136445145237 in words is "two trillion, one hundred thirty-six billion, four hundred forty-five million, one hundred forty-five thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •