Base | Representation |
---|---|
bin | 111110010111001011… |
… | …0010110101100111101 |
3 | 110210200020010002010011 |
4 | 1330232112112230331 |
5 | 4143232412121034 |
6 | 141304524343221 |
7 | 12450462542314 |
oct | 1745626265475 |
9 | 423606102104 |
10 | 133921598269 |
11 | 51883283a38 |
12 | 21b560a4b11 |
13 | c8234a5494 |
14 | 66a625127b |
15 | 373c29d864 |
hex | 1f2e596b3d |
133921598269 has 2 divisors, whose sum is σ = 133921598270. Its totient is φ = 133921598268.
The previous prime is 133921598243. The next prime is 133921598297. The reversal of 133921598269 is 962895129331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 118447482244 + 15474116025 = 344162^2 + 124395^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133921598269 is a prime.
It is a super-2 number, since 2×1339215982692 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133921898269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66960799134 + 66960799135.
It is an arithmetic number, because the mean of its divisors is an integer number (66960799135).
Almost surely, 2133921598269 is an apocalyptic number.
It is an amenable number.
133921598269 is a deficient number, since it is larger than the sum of its proper divisors (1).
133921598269 is an equidigital number, since it uses as much as digits as its factorization.
133921598269 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6298560, while the sum is 58.
The spelling of 133921598269 in words is "one hundred thirty-three billion, nine hundred twenty-one million, five hundred ninety-eight thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •