Base | Representation |
---|---|
bin | 110001001001100001… |
… | …1001100011010011101 |
3 | 101002102200222201211021 |
4 | 1202103003030122131 |
5 | 3212124323200013 |
6 | 120253131324141 |
7 | 10424351526325 |
oct | 1422303143235 |
9 | 332380881737 |
10 | 105546303133 |
11 | 408421557a7 |
12 | 185572b0651 |
13 | 9c508b5c0b |
14 | 51738cc285 |
15 | 2b2b103a8d |
hex | 18930cc69d |
105546303133 has 2 divisors, whose sum is σ = 105546303134. Its totient is φ = 105546303132.
The previous prime is 105546303113. The next prime is 105546303217. The reversal of 105546303133 is 331303645501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83112853849 + 22433449284 = 288293^2 + 149778^2 .
It is a cyclic number.
It is not a de Polignac number, because 105546303133 - 225 = 105512748701 is a prime.
It is a super-2 number, since 2×1055463031332 (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 (105546303113) 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, 52773151566 + 52773151567.
It is an arithmetic number, because the mean of its divisors is an integer number (52773151567).
Almost surely, 2105546303133 is an apocalyptic number.
It is an amenable number.
105546303133 is a deficient number, since it is larger than the sum of its proper divisors (1).
105546303133 is an equidigital number, since it uses as much as digits as its factorization.
105546303133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 34.
Adding to 105546303133 its reverse (331303645501), we get a palindrome (436849948634).
The spelling of 105546303133 in words is "one hundred five billion, five hundred forty-six million, three hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •