Base | Representation |
---|---|
bin | 111101111100000110… |
… | …0110111010110111111 |
3 | 110201022220200122220221 |
4 | 1323320030313112333 |
5 | 4134402331002202 |
6 | 141034433122211 |
7 | 12416122020532 |
oct | 1737014672677 |
9 | 421286618827 |
10 | 133013140927 |
11 | 514574a5547 |
12 | 219419b9367 |
13 | c70a20a464 |
14 | 661b732a19 |
15 | 36d7651037 |
hex | 1ef83375bf |
133013140927 has 2 divisors, whose sum is σ = 133013140928. Its totient is φ = 133013140926.
The previous prime is 133013140907. The next prime is 133013140961. The reversal of 133013140927 is 729041310331.
It is an a-pointer prime, because the next prime (133013140961) can be obtained adding 133013140927 to its sum of digits (34).
It is a weak prime.
It is an emirp because it is prime and its reverse (729041310331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133013140927 - 215 = 133013108159 is a prime.
It is a super-3 number, since 3×1330131409273 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133013140892 and 133013140901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133013140907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66506570463 + 66506570464.
It is an arithmetic number, because the mean of its divisors is an integer number (66506570464).
Almost surely, 2133013140927 is an apocalyptic number.
133013140927 is a deficient number, since it is larger than the sum of its proper divisors (1).
133013140927 is an equidigital number, since it uses as much as digits as its factorization.
133013140927 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 34.
The spelling of 133013140927 in words is "one hundred thirty-three billion, thirteen million, one hundred forty thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •