Base | Representation |
---|---|
bin | 10000000101001… |
… | …11101101110011 |
3 | 100101211212110001 |
4 | 20002213231303 |
5 | 234013422231 |
6 | 21215250431 |
7 | 3225446065 |
oct | 1002475563 |
9 | 311755401 |
10 | 134904691 |
11 | 6a171989 |
12 | 39219a17 |
13 | 21c4507c |
14 | 13cb9735 |
15 | bc9bb61 |
hex | 80a7b73 |
134904691 has 2 divisors, whose sum is σ = 134904692. Its totient is φ = 134904690.
The previous prime is 134904659. The next prime is 134904709. The reversal of 134904691 is 196409431.
134904691 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 134904691 - 25 = 134904659 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134904691.
It is not a weakly prime, because it can be changed into another prime (134904641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67452345 + 67452346.
It is an arithmetic number, because the mean of its divisors is an integer number (67452346).
Almost surely, 2134904691 is an apocalyptic number.
134904691 is a deficient number, since it is larger than the sum of its proper divisors (1).
134904691 is an equidigital number, since it uses as much as digits as its factorization.
134904691 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23328, while the sum is 37.
The square root of 134904691 is about 11614.8478681384. The cubic root of 134904691 is about 512.8720325468.
It can be divided in two parts, 13490 and 4691, that added together give a palindrome (18181).
The spelling of 134904691 in words is "one hundred thirty-four million, nine hundred four thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •