Base | Representation |
---|---|
bin | 11110010110101100100000… |
… | …011110110110111010000101 |
3 | 122111200120110011102102200112 |
4 | 132112230200132312322011 |
5 | 114444240033413443301 |
6 | 1151533304025522405 |
7 | 40056062364606362 |
oct | 3626544036667205 |
9 | 574616404372615 |
10 | 133501013421701 |
11 | 395a05097920a2 |
12 | 12b81483343405 |
13 | 596512618c163 |
14 | 24d76aab1b469 |
15 | 1067a038a39bb |
hex | 796b207b6e85 |
133501013421701 has 2 divisors, whose sum is σ = 133501013421702. Its totient is φ = 133501013421700.
The previous prime is 133501013421599. The next prime is 133501013421733. The reversal of 133501013421701 is 107124310105331.
It is an a-pointer prime, because the next prime (133501013421733) can be obtained adding 133501013421701 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95189877640900 + 38311135780801 = 9756530^2 + 6189599^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133501013421701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133501013426701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66750506710850 + 66750506710851.
It is an arithmetic number, because the mean of its divisors is an integer number (66750506710851).
Almost surely, 2133501013421701 is an apocalyptic number.
It is an amenable number.
133501013421701 is a deficient number, since it is larger than the sum of its proper divisors (1).
133501013421701 is an equidigital number, since it uses as much as digits as its factorization.
133501013421701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 32.
The spelling of 133501013421701 in words is "one hundred thirty-three trillion, five hundred one billion, thirteen million, four hundred twenty-one thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •