Base | Representation |
---|---|
bin | 11110010100011111110100… |
… | …000100111011111100001101 |
3 | 122111011010111220201211000022 |
4 | 132110133310010323330031 |
5 | 114434301141302324314 |
6 | 1151340041400111525 |
7 | 40042133636566253 |
oct | 3624376404737415 |
9 | 574133456654008 |
10 | 133349944573709 |
11 | 395424373166a6 |
12 | 12b581427655a5 |
13 | 5953acc348486 |
14 | 24d025941a5d3 |
15 | 1063b1104378e |
hex | 7947f413bf0d |
133349944573709 has 2 divisors, whose sum is σ = 133349944573710. Its totient is φ = 133349944573708.
The previous prime is 133349944573661. The next prime is 133349944573717. The reversal of 133349944573709 is 907375449943331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115154575620100 + 18195368953609 = 10731010^2 + 4265603^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133349944573709 is a prime.
It is a super-2 number, since 2×1333499445737092 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133349944573309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66674972286854 + 66674972286855.
It is an arithmetic number, because the mean of its divisors is an integer number (66674972286855).
Almost surely, 2133349944573709 is an apocalyptic number.
It is an amenable number.
133349944573709 is a deficient number, since it is larger than the sum of its proper divisors (1).
133349944573709 is an equidigital number, since it uses as much as digits as its factorization.
133349944573709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 925888320, while the sum is 71.
The spelling of 133349944573709 in words is "one hundred thirty-three trillion, three hundred forty-nine billion, nine hundred forty-four million, five hundred seventy-three thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •