Base | Representation |
---|---|
bin | 10010110100000001… |
… | …10100110000100101 |
3 | 222001220010020200201 |
4 | 21122000310300211 |
5 | 131141111201013 |
6 | 4350120110501 |
7 | 505201302034 |
oct | 113200646045 |
9 | 28056106621 |
10 | 10100100133 |
11 | 43132747a2 |
12 | 1b5a605431 |
13 | c4c667716 |
14 | 6bb57c71b |
15 | 3e1a823dd |
hex | 25a034c25 |
10100100133 has 2 divisors, whose sum is σ = 10100100134. Its totient is φ = 10100100132.
The previous prime is 10100100079. The next prime is 10100100139. The reversal of 10100100133 is 33100100101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8256084769 + 1844015364 = 90863^2 + 42942^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10100100133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100100139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050050066 + 5050050067.
It is an arithmetic number, because the mean of its divisors is an integer number (5050050067).
Almost surely, 210100100133 is an apocalyptic number.
It is an amenable number.
10100100133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100100133 is an equidigital number, since it uses as much as digits as its factorization.
10100100133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 10100100133 its reverse (33100100101), we get a palindrome (43200200234).
The spelling of 10100100133 in words is "ten billion, one hundred million, one hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •