Base | Representation |
---|---|
bin | 111110010010011111… |
… | …0010000000011101011 |
3 | 110210021021002201101212 |
4 | 1330210332100003223 |
5 | 4142422124102101 |
6 | 141241144503335 |
7 | 12443542442114 |
oct | 1744476200353 |
9 | 423237081355 |
10 | 133764284651 |
11 | 518024a6988 |
12 | 21b1147ab4b |
13 | c7c9a156ba |
14 | 668d3c120b |
15 | 372d5771bb |
hex | 1f24f900eb |
133764284651 has 2 divisors, whose sum is σ = 133764284652. Its totient is φ = 133764284650.
The previous prime is 133764284617. The next prime is 133764284663. The reversal of 133764284651 is 156482467331.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133764284651 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133764284651.
It is not a weakly prime, because it can be changed into another prime (133764284611) 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 as a sum of consecutive naturals, namely, 66882142325 + 66882142326.
It is an arithmetic number, because the mean of its divisors is an integer number (66882142326).
Almost surely, 2133764284651 is an apocalyptic number.
133764284651 is a deficient number, since it is larger than the sum of its proper divisors (1).
133764284651 is an equidigital number, since it uses as much as digits as its factorization.
133764284651 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2903040, while the sum is 50.
The spelling of 133764284651 in words is "one hundred thirty-three billion, seven hundred sixty-four million, two hundred eighty-four thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •