Base | Representation |
---|---|
bin | 111101111110110010… |
… | …0000010100010010101 |
3 | 110201120011222011110021 |
4 | 1323331210002202111 |
5 | 4140043343231401 |
6 | 141051405225141 |
7 | 12421263462154 |
oct | 1737544024225 |
9 | 421504864407 |
10 | 133103102101 |
11 | 514a325a722 |
12 | 21967b621b1 |
13 | c722a47818 |
14 | 662966d59b |
15 | 36e04c12a1 |
hex | 1efd902895 |
133103102101 has 2 divisors, whose sum is σ = 133103102102. Its totient is φ = 133103102100.
The previous prime is 133103102057. The next prime is 133103102137. The reversal of 133103102101 is 101201301331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77690412900 + 55412689201 = 278730^2 + 235399^2 .
It is a cyclic number.
It is not a de Polignac number, because 133103102101 - 225 = 133069547669 is a prime.
It is a super-2 number, since 2×1331031021012 (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 (133103102141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66551551050 + 66551551051.
It is an arithmetic number, because the mean of its divisors is an integer number (66551551051).
Almost surely, 2133103102101 is an apocalyptic number.
It is an amenable number.
133103102101 is a deficient number, since it is larger than the sum of its proper divisors (1).
133103102101 is an equidigital number, since it uses as much as digits as its factorization.
133103102101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 133103102101 its reverse (101201301331), we get a palindrome (234304403432).
The spelling of 133103102101 in words is "one hundred thirty-three billion, one hundred three million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •