Base | Representation |
---|---|
bin | 111110010010101100… |
… | …0000010011100010101 |
3 | 110210021201211011100102 |
4 | 1330211120002130111 |
5 | 4142430341412004 |
6 | 141241545423445 |
7 | 12443654055365 |
oct | 1744530023425 |
9 | 423251734312 |
10 | 133771044629 |
11 | 518062a3842 |
12 | 21b1379ab85 |
13 | c7cb2415a1 |
14 | 66902609a5 |
15 | 372de6011e |
hex | 1f25602715 |
133771044629 has 2 divisors, whose sum is σ = 133771044630. Its totient is φ = 133771044628.
The previous prime is 133771044613. The next prime is 133771044679. The reversal of 133771044629 is 926440177331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131386675729 + 2384368900 = 362473^2 + 48830^2 .
It is an emirp because it is prime and its reverse (926440177331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133771044629 - 24 = 133771044613 is a prime.
It is a super-2 number, since 2×1337710446292 (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 (133771044679) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66885522314 + 66885522315.
It is an arithmetic number, because the mean of its divisors is an integer number (66885522315).
Almost surely, 2133771044629 is an apocalyptic number.
It is an amenable number.
133771044629 is a deficient number, since it is larger than the sum of its proper divisors (1).
133771044629 is an equidigital number, since it uses as much as digits as its factorization.
133771044629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 762048, while the sum is 47.
The spelling of 133771044629 in words is "one hundred thirty-three billion, seven hundred seventy-one million, forty-four thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •