Base | Representation |
---|---|
bin | 11110001111101110011001… |
… | …101001110111000101101101 |
3 | 122102222210001121000000121001 |
4 | 132033232121221313011231 |
5 | 114413413034030341023 |
6 | 1150525245012240301 |
7 | 40006344262034023 |
oct | 3617563151670555 |
9 | 572883047000531 |
10 | 133022010012013 |
11 | 39426354858781 |
12 | 12b04682010091 |
13 | 592bbca031225 |
14 | 24bc42a2c0713 |
15 | 105a31b2476ad |
hex | 78fb99a7716d |
133022010012013 has 2 divisors, whose sum is σ = 133022010012014. Its totient is φ = 133022010012012.
The previous prime is 133022010011999. The next prime is 133022010012029. The reversal of 133022010012013 is 310210010220331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130545752138244 + 2476257873769 = 11425662^2 + 1573613^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133022010012013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133022010072013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66511005006006 + 66511005006007.
It is an arithmetic number, because the mean of its divisors is an integer number (66511005006007).
Almost surely, 2133022010012013 is an apocalyptic number.
It is an amenable number.
133022010012013 is a deficient number, since it is larger than the sum of its proper divisors (1).
133022010012013 is an equidigital number, since it uses as much as digits as its factorization.
133022010012013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 133022010012013 its reverse (310210010220331), we get a palindrome (443232020232344).
The spelling of 133022010012013 in words is "one hundred thirty-three trillion, twenty-two billion, ten million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •