Base | Representation |
---|---|
bin | 111111010010000101… |
… | …001100110110000101 |
3 | 20111101111012022200211 |
4 | 333102011030312011 |
5 | 2103124431310013 |
6 | 51114304435421 |
7 | 4623561501523 |
oct | 772205146605 |
9 | 214344168624 |
10 | 67949088133 |
11 | 268a9541693 |
12 | 11204018b71 |
13 | 653b585b34 |
14 | 34084a7313 |
15 | 1b7a54323d |
hex | fd214cd85 |
67949088133 has 2 divisors, whose sum is σ = 67949088134. Its totient is φ = 67949088132.
The previous prime is 67949088131. The next prime is 67949088157. The reversal of 67949088133 is 33188094976.
67949088133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 57476226564 + 10472861569 = 239742^2 + 102337^2 .
It is a cyclic number.
It is not a de Polignac number, because 67949088133 - 21 = 67949088131 is a prime.
It is a super-3 number, since 3×679490881333 (a number of 33 digits) contains 333 as substring.
Together with 67949088131, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (67949088131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33974544066 + 33974544067.
It is an arithmetic number, because the mean of its divisors is an integer number (33974544067).
Almost surely, 267949088133 is an apocalyptic number.
It is an amenable number.
67949088133 is a deficient number, since it is larger than the sum of its proper divisors (1).
67949088133 is an equidigital number, since it uses as much as digits as its factorization.
67949088133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7838208, while the sum is 58.
The spelling of 67949088133 in words is "sixty-seven billion, nine hundred forty-nine million, eighty-eight thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •