Base | Representation |
---|---|
bin | 110000111100010100… |
… | …0101011011010111001 |
3 | 101001021211002221122111 |
4 | 1201320220223122321 |
5 | 3210222401112013 |
6 | 120141141052321 |
7 | 10410360663124 |
oct | 1417050533271 |
9 | 331254087574 |
10 | 105103144633 |
11 | 40634a92203 |
12 | 184529b70a1 |
13 | 9bacb43256 |
14 | 5130ad13bb |
15 | 2b0226773d |
hex | 1878a2b6b9 |
105103144633 has 2 divisors, whose sum is σ = 105103144634. Its totient is φ = 105103144632.
The previous prime is 105103144621. The next prime is 105103144637. The reversal of 105103144633 is 336441301501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103704609024 + 1398535609 = 322032^2 + 37397^2 .
It is a cyclic number.
It is not a de Polignac number, because 105103144633 - 225 = 105069590201 is a prime.
It is a super-2 number, since 2×1051031446332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105103144595 and 105103144604.
It is not a weakly prime, because it can be changed into another prime (105103144637) 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, 52551572316 + 52551572317.
It is an arithmetic number, because the mean of its divisors is an integer number (52551572317).
Almost surely, 2105103144633 is an apocalyptic number.
It is an amenable number.
105103144633 is a deficient number, since it is larger than the sum of its proper divisors (1).
105103144633 is an equidigital number, since it uses as much as digits as its factorization.
105103144633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 31.
The spelling of 105103144633 in words is "one hundred five billion, one hundred three million, one hundred forty-four thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •