Base | Representation |
---|---|
bin | 111110101011100000… |
… | …0001001100011111111 |
3 | 110212102202111112210010 |
4 | 1331113000021203333 |
5 | 4201132013040020 |
6 | 141500331114303 |
7 | 12503414042313 |
oct | 1752700114377 |
9 | 425382445703 |
10 | 134603643135 |
11 | 520a327a385 |
12 | 221065a2993 |
13 | c901899120 |
14 | 672ca73b43 |
15 | 377c0c5de0 |
hex | 1f570098ff |
134603643135 has 32 divisors (see below), whose sum is σ = 231951867840. Its totient is φ = 66260855808.
The previous prime is 134603643131. The next prime is 134603643191. The reversal of 134603643135 is 531346306431.
It is a happy number.
It is not a de Polignac number, because 134603643135 - 22 = 134603643131 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 134603643093 and 134603643102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134603643131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3261147 + ... + 3302163.
It is an arithmetic number, because the mean of its divisors is an integer number (7248495870).
Almost surely, 2134603643135 is an apocalyptic number.
134603643135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
134603643135 is a deficient number, since it is larger than the sum of its proper divisors (97348224705).
134603643135 is a wasteful number, since it uses less digits than its factorization.
134603643135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57867.
The product of its (nonzero) digits is 233280, while the sum is 39.
Adding to 134603643135 its reverse (531346306431), we get a palindrome (665949949566).
The spelling of 134603643135 in words is "one hundred thirty-four billion, six hundred three million, six hundred forty-three thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •