Base | Representation |
---|---|
bin | 111111001001001111… |
… | …0100001100000000011 |
3 | 110222000022001221220122 |
4 | 1332102132201200003 |
5 | 4210202433230001 |
6 | 142143333530455 |
7 | 12540221255114 |
oct | 1762236414003 |
9 | 428008057818 |
10 | 135601461251 |
11 | 52565542953 |
12 | 223447a3a2b |
13 | ca30521149 |
14 | 67c53b420b |
15 | 37d99c5b1b |
hex | 1f927a1803 |
135601461251 has 8 divisors (see below), whose sum is σ = 136508242080. Its totient is φ = 134697416832.
The previous prime is 135601461239. The next prime is 135601461257. The reversal of 135601461251 is 152164106531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135601461251 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135601461257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 584615 + ... + 782928.
It is an arithmetic number, because the mean of its divisors is an integer number (17063530260).
Almost surely, 2135601461251 is an apocalyptic number.
135601461251 is a deficient number, since it is larger than the sum of its proper divisors (906780829).
135601461251 is a wasteful number, since it uses less digits than its factorization.
135601461251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1368205.
The product of its (nonzero) digits is 21600, while the sum is 35.
Adding to 135601461251 its reverse (152164106531), we get a palindrome (287765567782).
The spelling of 135601461251 in words is "one hundred thirty-five billion, six hundred one million, four hundred sixty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •