Base | Representation |
---|---|
bin | 111111011001011110… |
… | …0101000011101111001 |
3 | 111000102021010211022102 |
4 | 1332302330220131321 |
5 | 4212311413200032 |
6 | 142313354033145 |
7 | 12556554550505 |
oct | 1766274503571 |
9 | 430367124272 |
10 | 136146225017 |
11 | 52814aa3a40 |
12 | 224771187b5 |
13 | cab934a17a |
14 | 683789d305 |
15 | 381c732362 |
hex | 1fb2f28779 |
136146225017 has 8 divisors (see below), whose sum is σ = 148528426080. Its totient is φ = 123764902560.
The previous prime is 136146224999. The next prime is 136146225037. The reversal of 136146225017 is 710522641631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 136146225017 - 218 = 136145962873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136146225037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 128333 + ... + 537365.
It is an arithmetic number, because the mean of its divisors is an integer number (18566053260).
Almost surely, 2136146225017 is an apocalyptic number.
It is an amenable number.
136146225017 is a deficient number, since it is larger than the sum of its proper divisors (12382201063).
136146225017 is a wasteful number, since it uses less digits than its factorization.
136146225017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439303.
The product of its (nonzero) digits is 60480, while the sum is 38.
Adding to 136146225017 its reverse (710522641631), we get a palindrome (846668866648).
It can be divided in two parts, 136146 and 225017, that added together give a palindrome (361163).
The spelling of 136146225017 in words is "one hundred thirty-six billion, one hundred forty-six million, two hundred twenty-five thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •