Base | Representation |
---|---|
bin | 10000001100000… |
… | …00101100110111 |
3 | 100110112000121112 |
4 | 20012000230313 |
5 | 234230342323 |
6 | 21250305235 |
7 | 3236140211 |
oct | 1006005467 |
9 | 313460545 |
10 | 135793463 |
11 | 6a719703 |
12 | 3958821b |
13 | 22196780 |
14 | 1406b5b1 |
15 | bdc5178 |
hex | 8180b37 |
135793463 has 8 divisors (see below), whose sum is σ = 146335728. Its totient is φ = 125265024.
The previous prime is 135793459. The next prime is 135793499. The reversal of 135793463 is 364397531.
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 135793463 - 22 = 135793459 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 135793463.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135793363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26831 + ... + 31487.
It is an arithmetic number, because the mean of its divisors is an integer number (18291966).
Almost surely, 2135793463 is an apocalyptic number.
135793463 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
135793463 is a deficient number, since it is larger than the sum of its proper divisors (10542265).
135793463 is a wasteful number, since it uses less digits than its factorization.
135793463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6913.
The product of its digits is 204120, while the sum is 41.
The square root of 135793463 is about 11653.0452243180. The cubic root of 135793463 is about 513.9958603632.
The spelling of 135793463 in words is "one hundred thirty-five million, seven hundred ninety-three thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •