Base | Representation |
---|---|
bin | 11110001111100100010101… |
… | …011000110011010011011111 |
3 | 122102221202011021221222101202 |
4 | 132033210111120303103133 |
5 | 114413223414424403314 |
6 | 1150520300250030115 |
7 | 40005512362045163 |
oct | 3617442530632337 |
9 | 572852137858352 |
10 | 133011201012959 |
11 | 39421808416805 |
12 | 12b0256611833b |
13 | 592ab9685cab9 |
14 | 24bbac292cca3 |
15 | 1059dd73360de |
hex | 78f9156334df |
133011201012959 has 2 divisors, whose sum is σ = 133011201012960. Its totient is φ = 133011201012958.
The previous prime is 133011201012929. The next prime is 133011201013063. The reversal of 133011201012959 is 959210102110331.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133011201012959 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133011201012929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66505600506479 + 66505600506480.
It is an arithmetic number, because the mean of its divisors is an integer number (66505600506480).
Almost surely, 2133011201012959 is an apocalyptic number.
133011201012959 is a deficient number, since it is larger than the sum of its proper divisors (1).
133011201012959 is an equidigital number, since it uses as much as digits as its factorization.
133011201012959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 38.
The spelling of 133011201012959 in words is "one hundred thirty-three trillion, eleven billion, two hundred one million, twelve thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •