Base | Representation |
---|---|
bin | 1111111101110… |
… | …01111011001001 |
3 | 100100000101101012 |
4 | 13332321323021 |
5 | 233241240242 |
6 | 21142333305 |
7 | 3214251335 |
oct | 776717311 |
9 | 310011335 |
10 | 133930697 |
11 | 6966712a |
12 | 38a2a235 |
13 | 21993944 |
14 | 13b047c5 |
15 | bb58282 |
hex | 7fb9ec9 |
133930697 has 4 divisors (see below), whose sum is σ = 133982100. Its totient is φ = 133879296.
The previous prime is 133930669. The next prime is 133930717. The reversal of 133930697 is 796039331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 796039331 = 17 ⋅46825843.
It can be written as a sum of positive squares in 2 ways, for example, as 95043001 + 38887696 = 9749^2 + 6236^2 .
It is a cyclic number.
It is not a de Polignac number, because 133930697 - 210 = 133929673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133930627) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21572 + ... + 27077.
It is an arithmetic number, because the mean of its divisors is an integer number (33495525).
Almost surely, 2133930697 is an apocalyptic number.
It is an amenable number.
133930697 is a deficient number, since it is larger than the sum of its proper divisors (51403).
133930697 is an equidigital number, since it uses as much as digits as its factorization.
133930697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51402.
The product of its (nonzero) digits is 91854, while the sum is 41.
The square root of 133930697 is about 11572.8430819743. The cubic root of 133930697 is about 511.6347607253.
The spelling of 133930697 in words is "one hundred thirty-three million, nine hundred thirty thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •