Base | Representation |
---|---|
bin | 110001101101110011… |
… | …1101100000100100101 |
3 | 101012120112222111001221 |
4 | 1203123213230010211 |
5 | 3222123020021131 |
6 | 121014023220341 |
7 | 10466464402105 |
oct | 1433347540445 |
9 | 335515874057 |
10 | 106763829541 |
11 | 41307442376 |
12 | 18836ba76b1 |
13 | a0b5c05945 |
14 | 524b4a1205 |
15 | 2b9ce52411 |
hex | 18db9ec125 |
106763829541 has 2 divisors, whose sum is σ = 106763829542. Its totient is φ = 106763829540.
The previous prime is 106763829509. The next prime is 106763829553. The reversal of 106763829541 is 145928367601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57422536900 + 49341292641 = 239630^2 + 222129^2 .
It is a cyclic number.
It is not a de Polignac number, because 106763829541 - 25 = 106763829509 is a prime.
It is a super-2 number, since 2×1067638295412 (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 (106763809541) 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, 53381914770 + 53381914771.
It is an arithmetic number, because the mean of its divisors is an integer number (53381914771).
It is a 1-persistent number, because it is pandigital, but 2⋅106763829541 = 213527659082 is not.
Almost surely, 2106763829541 is an apocalyptic number.
It is an amenable number.
106763829541 is a deficient number, since it is larger than the sum of its proper divisors (1).
106763829541 is an equidigital number, since it uses as much as digits as its factorization.
106763829541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2177280, while the sum is 52.
The spelling of 106763829541 in words is "one hundred six billion, seven hundred sixty-three million, eight hundred twenty-nine thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •