Base | Representation |
---|---|
bin | 111110111001001010… |
… | …1101000101100110011 |
3 | 110220121201110201120121 |
4 | 1331302111220230303 |
5 | 4203101414314111 |
6 | 142014032551111 |
7 | 12520653162262 |
oct | 1756225505463 |
9 | 426551421517 |
10 | 135062260531 |
11 | 52309141420 |
12 | 222140b2497 |
13 | c9758c2273 |
14 | 67739365d9 |
15 | 37a74b7871 |
hex | 1f72568b33 |
135062260531 has 8 divisors (see below), whose sum is σ = 153746763264. Its totient is φ = 117445443720.
The previous prime is 135062260511. The next prime is 135062260537.
135062260531 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 135062260531 - 217 = 135062129459 is a prime.
It is a super-2 number, since 2×1350622605312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135062260537) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 266921211 + ... + 266921716.
It is an arithmetic number, because the mean of its divisors is an integer number (19218345408).
Almost surely, 2135062260531 is an apocalyptic number.
135062260531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
135062260531 is a deficient number, since it is larger than the sum of its proper divisors (18684502733).
135062260531 is a wasteful number, since it uses less digits than its factorization.
135062260531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 533842961.
The product of its (nonzero) digits is 32400, while the sum is 34.
It can be divided in two parts, 135062 and 260531, that added together give a palindrome (395593).
The spelling of 135062260531 in words is "one hundred thirty-five billion, sixty-two million, two hundred sixty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •