Base | Representation |
---|---|
bin | 111111001011100001… |
… | …0000101001100011110 |
3 | 110222012121220000022100 |
4 | 1332113002011030132 |
5 | 4210332020010413 |
6 | 142155104025530 |
7 | 12542140022322 |
oct | 1762702051436 |
9 | 428177800270 |
10 | 135677891358 |
11 | 525a46a5a29 |
12 | 223663022a6 |
13 | ca43301669 |
14 | 67d15cb982 |
15 | 37e1571a73 |
hex | 1f9708531e |
135677891358 has 24 divisors (see below), whose sum is σ = 295198768800. Its totient is φ = 45036732384.
The previous prime is 135677891339. The next prime is 135677891389. The reversal of 135677891358 is 853198776531.
135677891358 is a `hidden beast` number, since 1 + 3 + 567 + 7 + 8 + 9 + 13 + 58 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 135677891295 and 135677891304.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15764863 + ... + 15773466.
It is an arithmetic number, because the mean of its divisors is an integer number (12299948700).
Almost surely, 2135677891358 is an apocalyptic number.
135677891358 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
135677891358 is an abundant number, since it is smaller than the sum of its proper divisors (159520877442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135677891358 is a wasteful number, since it uses less digits than its factorization.
135677891358 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31538576 (or 31538573 counting only the distinct ones).
The product of its digits is 38102400, while the sum is 63.
The spelling of 135677891358 in words is "one hundred thirty-five billion, six hundred seventy-seven million, eight hundred ninety-one thousand, three hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •