Base | Representation |
---|---|
bin | 110000101000010110… |
… | …1100000101000100001 |
3 | 100222120010201110110102 |
4 | 1201100231200220201 |
5 | 3202334412310104 |
6 | 115550452312145 |
7 | 10354645411034 |
oct | 1412055405041 |
9 | 328503643412 |
10 | 104433322529 |
11 | 40320984a18 |
12 | 182a6612655 |
13 | 9b0413bb03 |
14 | 50a9b7101b |
15 | 2ab3556a1e |
hex | 1850b60a21 |
104433322529 has 2 divisors, whose sum is σ = 104433322530. Its totient is φ = 104433322528.
The previous prime is 104433322501. The next prime is 104433322549. The reversal of 104433322529 is 925223334401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103951432225 + 481890304 = 322415^2 + 21952^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104433322529 is a prime.
It is a super-2 number, since 2×1044333225292 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104433322492 and 104433322501.
It is not a weakly prime, because it can be changed into another prime (104433322549) 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, 52216661264 + 52216661265.
It is an arithmetic number, because the mean of its divisors is an integer number (52216661265).
Almost surely, 2104433322529 is an apocalyptic number.
It is an amenable number.
104433322529 is a deficient number, since it is larger than the sum of its proper divisors (1).
104433322529 is an equidigital number, since it uses as much as digits as its factorization.
104433322529 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 38.
The spelling of 104433322529 in words is "one hundred four billion, four hundred thirty-three million, three hundred twenty-two thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •