Base | Representation |
---|---|
bin | 10011100011110001… |
… | …01100001101001101 |
3 | 1000002210202211012211 |
4 | 21301320230031031 |
5 | 133001124334013 |
6 | 4453544430421 |
7 | 521133543532 |
oct | 116170541515 |
9 | 30083684184 |
10 | 10500621133 |
11 | 44a9366092 |
12 | 2050778411 |
13 | cb462c1b2 |
14 | 71883ad89 |
15 | 416cea23d |
hex | 271e2c34d |
10500621133 has 2 divisors, whose sum is σ = 10500621134. Its totient is φ = 10500621132.
The previous prime is 10500621071. The next prime is 10500621139. The reversal of 10500621133 is 33112600501.
It is a happy number.
10500621133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5949499689 + 4551121444 = 77133^2 + 67462^2 .
It is a cyclic number.
It is not a de Polignac number, because 10500621133 - 229 = 9963750221 is a prime.
It is a super-2 number, since 2×105006211332 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10500621139) 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, 5250310566 + 5250310567.
It is an arithmetic number, because the mean of its divisors is an integer number (5250310567).
Almost surely, 210500621133 is an apocalyptic number.
It is an amenable number.
10500621133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10500621133 is an equidigital number, since it uses as much as digits as its factorization.
10500621133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 22.
The spelling of 10500621133 in words is "ten billion, five hundred million, six hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •