Base | Representation |
---|---|
bin | 10000000101001… |
… | …01100100101001 |
3 | 100101211102101221 |
4 | 20002211210221 |
5 | 234013132123 |
6 | 21215142041 |
7 | 3225411355 |
oct | 1002454451 |
9 | 311742357 |
10 | 134895913 |
11 | 6a166329 |
12 | 39214921 |
13 | 21c41089 |
14 | 13cb6465 |
15 | bc9925d |
hex | 80a5929 |
134895913 has 2 divisors, whose sum is σ = 134895914. Its totient is φ = 134895912.
The previous prime is 134895853. The next prime is 134895923. The reversal of 134895913 is 319598431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 133448704 + 1447209 = 11552^2 + 1203^2 .
It is an emirp because it is prime and its reverse (319598431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 134895913 - 29 = 134895401 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134895913.
It is not a weakly prime, because it can be changed into another prime (134895923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67447956 + 67447957.
It is an arithmetic number, because the mean of its divisors is an integer number (67447957).
Almost surely, 2134895913 is an apocalyptic number.
It is an amenable number.
134895913 is a deficient number, since it is larger than the sum of its proper divisors (1).
134895913 is an equidigital number, since it uses as much as digits as its factorization.
134895913 is an evil number, because the sum of its binary digits is even.
The product of its digits is 116640, while the sum is 43.
The square root of 134895913 is about 11614.4699836024. The cubic root of 134895913 is about 512.8609084257.
The spelling of 134895913 in words is "one hundred thirty-four million, eight hundred ninety-five thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •